作者: 奇怪 時(shí)間: 2025-3-21 22:45
978-3-540-44080-2Springer-Verlag Berlin Heidelberg 2002作者: Lineage 時(shí)間: 2025-3-22 01:11 作者: Corroborate 時(shí)間: 2025-3-22 07:42
Perspectives in Neural Computinguery containment both in the absence and presence of constraints. Containment without constraints for CRPQs is EXPSPACE-complete, as opposed to only NP-complete for relational conjunctive queries. Our past experience with implementing similar algorithms suggests that staying in PSPACE might still be作者: 投票 時(shí)間: 2025-3-22 12:14 作者: LEER 時(shí)間: 2025-3-22 15:47
A. L?rincz,B. Szatmáry,G. Szirtes,B. Takácsmodel) and a query as a formula of the temporal logic .. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.作者: LEER 時(shí)間: 2025-3-22 19:33
Hervé A. Bourlard,Nelson Morgantidimensional database to changing requirements. In earlier work we proposed a temporal multidimensional model and ., a query language supporting it, accounting for dimension updates and schema evolution at a high level of abstraction. In this paper we present our implementation of the model and the作者: 脫水 時(shí)間: 2025-3-23 00:24 作者: Ingenuity 時(shí)間: 2025-3-23 04:58
Hervé A. Bourlard,Nelson Morganencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models.作者: debouch 時(shí)間: 2025-3-23 09:05
Hervé A. Bourlard,Nelson Morganof hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and de作者: chronicle 時(shí)間: 2025-3-23 12:44 作者: gonioscopy 時(shí)間: 2025-3-23 14:21 作者: 發(fā)酵 時(shí)間: 2025-3-23 19:35 作者: TIA742 時(shí)間: 2025-3-23 22:13 作者: SOBER 時(shí)間: 2025-3-24 04:02 作者: obligation 時(shí)間: 2025-3-24 07:42
E. Buddecke,H. Kresse,G. Segeth,K. V. Figura of schemas, and it applies to transformations of both the schema structure and its integrity constraints. A subtle problem of schema integration is considered in its general form, not bound to any particular category of schemas. The proposed solution, as well as the overall theory, is based entirel作者: TOM 時(shí)間: 2025-3-24 12:09 作者: FEMUR 時(shí)間: 2025-3-24 17:37 作者: Engaged 時(shí)間: 2025-3-24 21:05
https://doi.org/10.1007/978-1-4612-5967-1he field of information systems and XML data management. In fact, information systems will have to generate XML documents, obtained by querying the underlying DBMS..This paper informally introduces the ERX-Query Language (ERX-QL), under development as part of ERX Data Management System (developed at作者: 幻想 時(shí)間: 2025-3-25 01:39
Structure and Function of Aorta Proteoglycanmal and general route to optimising such rules. We produce a specialised version of the rule execution semantics for each possible sequence of actions that may execute from the current database state. This gives the opportunity to optimise rule execution for each particular sequence of actions. We o作者: 群居男女 時(shí)間: 2025-3-25 07:20
https://doi.org/10.1007/978-1-4612-5967-1solation-Durability) properties of classical transactions. Such extensions, usually called . (ATMs), have been proposed for dealing with new database applications involving long-lived, endless, and cooperative activities. Our approach appeals to non-Markovian theories, in which one may refer to past作者: ferment 時(shí)間: 2025-3-25 08:35 作者: Density 時(shí)間: 2025-3-25 13:27 作者: FLING 時(shí)間: 2025-3-25 16:08
A. L?rincz,B. Szatmáry,G. Szirtes,B. Takácsmodel) and a query as a formula of the temporal logic .. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.作者: 真實(shí)的人 時(shí)間: 2025-3-26 00:01
Hervé A. Bourlard,Nelson Morganencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models.作者: Anthropoid 時(shí)間: 2025-3-26 01:13
Hervé A. Bourlard,Nelson Morganof hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and decidable in PTIME in the size of keys.作者: 異端邪說(shuō)2 時(shí)間: 2025-3-26 05:24 作者: Aromatic 時(shí)間: 2025-3-26 09:29
Model-Checking Based Data Retrievalmodel) and a query as a formula of the temporal logic .. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.作者: Ambulatory 時(shí)間: 2025-3-26 14:44
On Monotone Data Mining Languagesencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models.作者: 脆弱帶來(lái) 時(shí)間: 2025-3-26 16:56 作者: convert 時(shí)間: 2025-3-26 21:49 作者: Inexorable 時(shí)間: 2025-3-27 02:07 作者: Directed 時(shí)間: 2025-3-27 08:02 作者: 負(fù)擔(dān) 時(shí)間: 2025-3-27 12:27 作者: Adulate 時(shí)間: 2025-3-27 16:09
Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrarebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dimensions..Consequently, we can prove that first-order logic with a transitive closure operator extended with stop conditions, can express all Boolean topological queries on semi-algebraic spatial databases of arbitrary dimension.作者: Consensus 時(shí)間: 2025-3-27 18:27 作者: 萬(wàn)靈丹 時(shí)間: 2025-3-27 23:58 作者: 尊嚴(yán) 時(shí)間: 2025-3-28 02:49 作者: 天氣 時(shí)間: 2025-3-28 07:34 作者: Alienated 時(shí)間: 2025-3-28 14:12
Molecular Interrelationships and Functions,ne nature of time..We investigate different genericity classes relative to the constraint database model for spatio-temporal databases and we identify sound and complete languages for the first-order, respectively the computable, queries in these genericity classes.作者: 情感脆弱 時(shí)間: 2025-3-28 16:55
https://doi.org/10.1007/978-1-4612-5967-1 XML documents. This way, ERX-QL naturally deals with recursive and nested XML structures. Furthermore, the rich extended ER database provided by the ERX system makes ERX-QL rich and powerful, thus suitable, with minor changes, to be adopted on classical RDBMSs.作者: figure 時(shí)間: 2025-3-28 19:05 作者: interlude 時(shí)間: 2025-3-28 23:28
A Theory of Spatio-temporal Database Queriesne nature of time..We investigate different genericity classes relative to the constraint database model for spatio-temporal databases and we identify sound and complete languages for the first-order, respectively the computable, queries in these genericity classes.作者: Keratin 時(shí)間: 2025-3-29 03:24
ERX-QL: Querying an Entity-Relationship DB to Obtain XML Documents XML documents. This way, ERX-QL naturally deals with recursive and nested XML structures. Furthermore, the rich extended ER database provided by the ERX system makes ERX-QL rich and powerful, thus suitable, with minor changes, to be adopted on classical RDBMSs.作者: Canopy 時(shí)間: 2025-3-29 07:51 作者: SPALL 時(shí)間: 2025-3-29 13:41
Four Lectures on Secant Varietiess is also used for a declarative specification how the database should be .: XPath filters are interpreted as specifications of elements and properties that should be added to the database. In this paper, we focus on the theoretical aspects of XPathLog. XPathLog has been implemented in the LoPiX system [.].作者: 古董 時(shí)間: 2025-3-29 17:39 作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-29 19:56 作者: 迎合 時(shí)間: 2025-3-30 01:21 作者: ETCH 時(shí)間: 2025-3-30 06:27 作者: glomeruli 時(shí)間: 2025-3-30 09:01 作者: BUDGE 時(shí)間: 2025-3-30 13:04 作者: arthroplasty 時(shí)間: 2025-3-30 19:42
A Temporal Query Language for OLAP: Implementation and a Case Studycial systems cannot deal with. We present results on query and dimension update performance, and briefly describe a visualization tool that allows editing and running . queries, performing dimension updates, and browsing dimensions across time.作者: 壁畫 時(shí)間: 2025-3-30 21:06
An Application-Specific Databasedescribe Hancock’s database mechanism, evaluate its performance, and compare an application written in Hancock with an equivalent application written in Daytona [.], a very efficient relational database system.作者: 中和 時(shí)間: 2025-3-31 02:26 作者: 悲觀 時(shí)間: 2025-3-31 07:00 作者: plasma-cells 時(shí)間: 2025-3-31 10:29 作者: Blood-Vessels 時(shí)間: 2025-3-31 15:32 作者: 擴(kuò)音器 時(shí)間: 2025-3-31 19:35 作者: 發(fā)電機(jī) 時(shí)間: 2025-4-1 00:44
Model-Checking Based Data Retrievalmodel) and a query as a formula of the temporal logic .. In this way, the retrieval of data fulfilling a query is reduced to the problem of finding out the states of the model which satisfy the formula (the model-checking problem) that can be done in linear time.作者: 不能逃避 時(shí)間: 2025-4-1 02:57 作者: 我沒(méi)有強(qiáng)迫 時(shí)間: 2025-4-1 09:13 作者: jungle 時(shí)間: 2025-4-1 13:58
