作者: flourish 時間: 2025-3-21 22:43
XPath Query ProcessingXSLT and XQuery. Implementations of XPath need to scale well . with respect to the size of the XML data and the growing size and intricacy of the queries (i.e., .). Unfortunately, current XPath engines use query evaluation techniques that require time . in the size of queries in the worst case [1]..作者: objection 時間: 2025-3-22 02:09 作者: 遺產(chǎn) 時間: 2025-3-22 05:58
Containment of Relational Queries with Annotation Propagationuery is . in another if the annotated output of the former is contained in the latter on every possible annotated input databases. We study the relationship between query containment and annotation-containment and show that annotation-containment is a more refined notion in general. As a consequence作者: Respond 時間: 2025-3-22 11:12 作者: 事先無準備 時間: 2025-3-22 15:37
Consistency of Java Transactionsy are proved. An implementation technique for incorporating constraints into the existing Java technology is developed, and a sophisticated theorem prover technology is integrated into this environment capable of enforcing behavioral compatibility and verifying transaction safety. The model of Java 作者: 事先無準備 時間: 2025-3-22 20:08 作者: SYN 時間: 2025-3-23 00:52 作者: CRUMB 時間: 2025-3-23 03:53 作者: 并入 時間: 2025-3-23 09:26
Semantics of Objectified XML Constraintss integrated paradigm is based on Featherweight Java and XML is represented by regular expression types. The main contributions are in extending both with general logic-based constraints and establishing results on schema and database evolution by inheritance that respects database integrity require作者: 拉開這車床 時間: 2025-3-23 10:35
M2ORM2: A Model for the Transparent Management of Relationally Persistent Objectspersistent classes and the relational database in an independent way, and to use an object persistent manager to connect them in a suitable way. This paper introduces M.ORM., a model for describing meet-in-the-middle mappings between object schemas and relational schemas, to support the transparent 作者: 使更活躍 時間: 2025-3-23 15:09
Using XQuery for Flat-File Based Scientific Datasetsbased scientific datasets. Traditionally, complex and domain-specific data layouts have complicated the processing of large datasets arising from scientific applications. The use of XML schemas and XQuery’s high-level structure can simplify the analysis on these datasets..Though scientific data proc作者: Vasodilation 時間: 2025-3-23 19:11 作者: Ankylo- 時間: 2025-3-23 23:50
Updates and Incremental Validation of XML Documentse verified that the new document still conforms to the imposed constraints. Incremental validation of updates leads to significant savings on computing time when compared to brute-force validation of an updated document from scratch..This paper introduces a correct and complete set of update operati作者: Vaginismus 時間: 2025-3-24 04:40
Attribute Grammars for Scalable Query Processing on XML Streams linear time with bounded memory consumption independent of the size of the stream) that allows for actual data transformations rather than just document filtering. XSAGs are also relatively easy to use for humans. Moreover, the XSAG formalism provides a strong intuition for which queries can or can作者: UTTER 時間: 2025-3-24 10:01 作者: 填滿 時間: 2025-3-24 11:03 作者: 雕鏤 時間: 2025-3-24 18:05
https://doi.org/10.1007/978-94-007-6001-1nd rule execution is modelled as a theorem proving task using active relational theories as background axioms. We show that major components of an ADBMS may be given a clear semantics using active relational theories.作者: curriculum 時間: 2025-3-24 19:57 作者: Flat-Feet 時間: 2025-3-25 00:56
A Unifying Semantics for Active Databases Using Non-Markovian Theories of Actionsnd rule execution is modelled as a theorem proving task using active relational theories as background axioms. We show that major components of an ADBMS may be given a clear semantics using active relational theories.作者: ABIDE 時間: 2025-3-25 05:37
Sonic Consciousness in Hindu India approaches to XML (as well as object-oriented) constraints. A pleasing property of this model theory is that it offers specific requirements for semantically acceptable evolution of these sophisticated schemas and their databases.作者: 精致 時間: 2025-3-25 10:18 作者: Coronation 時間: 2025-3-25 13:10 作者: 脾氣暴躁的人 時間: 2025-3-25 16:48 作者: 泄露 時間: 2025-3-25 22:47
Updates and Incremental Validation of XML Documentslt is checked first (without any change on the original document). Validation tests are performed incrementally, ., only the validity of the part of the document directly affected by the update is checked. Changes to the original document are effectively performed . when the update is accepted.作者: ELATE 時間: 2025-3-26 01:45
A General Framework for Estimating XML Query CardinalityWR queries, hence allowing the model designer to concentrate her efforts on the development of adequate and accurate, while concise, statistic summaries for XML data. The framework can also be used for extending existing models to a wider class of XML queries.作者: 地牢 時間: 2025-3-26 05:56
Sonic Consciousness in Hindu Indiapaper introduces M.ORM., a model for describing meet-in-the-middle mappings between object schemas and relational schemas, to support the transparent management of object persistence by means of relational databases.作者: 整理 時間: 2025-3-26 10:53 作者: 飛鏢 時間: 2025-3-26 14:00
Attribute Grammars for Scalable Query Processing on XML Streamsnot be processed scalably on streams. We introduce XSAGs together with the necessary language-theoretic machinery, study their theoretical properties such as their expressiveness and complexity, and discuss their implementation.作者: 競選運動 時間: 2025-3-26 19:52
M2ORM2: A Model for the Transparent Management of Relationally Persistent Objectspaper introduces M.ORM., a model for describing meet-in-the-middle mappings between object schemas and relational schemas, to support the transparent management of object persistence by means of relational databases.作者: Tractable 時間: 2025-3-26 22:40
https://doi.org/10.1007/978-94-007-6001-1 an architecture for automatically generating application-level checks from application and database integrity constraint specifications. We focus on EJB-database interactions as a concrete context for our work, but our results are applicable to other programming language-database interactions.作者: aesthetician 時間: 2025-3-27 04:49 作者: 特別容易碎 時間: 2025-3-27 08:18 作者: CRASS 時間: 2025-3-27 13:12
Containment of Relational Queries with Annotation Propagationharacterization suggests that annotation-containment is more complex than query containment, we show that the annotation-containment problem is NP-complete, thus putting it in the same complexity class as query containment. In addition, we show that the annotation placement problem, which was first 作者: apropos 時間: 2025-3-27 16:37 作者: 無法取消 時間: 2025-3-27 20:00 作者: legislate 時間: 2025-3-27 23:11 作者: DIS 時間: 2025-3-28 02:12
Andrea Eugenio Cavanna,Andrea Nanit prominently one that can be evaluated in linear time (cf. [1,3]). Next we discuss the parallel complexity of XPath. While full XPath is P-complete w.r.t. combined complexity, various (minor) restrictions are known which reduce the complexity to highly parallelizable complexity classes [2]. Finally作者: 寒冷 時間: 2025-3-28 09:22 作者: 率直 時間: 2025-3-28 13:26
An Epistemology for Phenomenology? is based on the PVS theorem prover technology, and it combines static and dynamic checking to attain reasonable performance. The theorem prover technology is itself based on a sophisticated type system equipped with a form of semantic subtyping and parametric polymorphism. The higher-order features作者: 可卡 時間: 2025-3-28 17:27 作者: AMEND 時間: 2025-3-28 20:18
Consciousness and Mathematical Sciencesel offers the flexibility required by the server to disseminate data in manageable fragments, whenever they become available, and to send repetitions, replacements and removal of fragments. We then present a query algebra for XQuery that operates on this streamed XML data model. The XML fragments ar作者: Limited 時間: 2025-3-29 02:17
Database Programming Languages978-3-540-24607-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 慢跑鞋 時間: 2025-3-29 05:03 作者: 不可接觸 時間: 2025-3-29 10:08
Andrea Eugenio Cavanna,Andrea Nani their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem. Finally, we establish a link between XPath expressions and partial tree descriptions which are studied in computational linguistics.作者: coagulate 時間: 2025-3-29 11:35
https://doi.org/10.1007/978-94-007-6001-1 expressions are unnecessary. Additionally we define a deterministic automaton that illustrates how these rules can be translated into an efficient algorithm. This work is an important first step in the understanding and tackling of XPath/XQuery optimization problems that are related to ordering and duplicate removal.作者: 鴕鳥 時間: 2025-3-29 19:34
On the Non-Computability of Consciousness, and an extension of the .-calculus with process mobility and with an operation for interacting with data. Our model can be used to reason about behaviour found in, for example, dynamic web page programming, applet interaction, and service orchestration. We study behavioural equivalences for X., motivated by examples.作者: gonioscopy 時間: 2025-3-29 20:10
https://doi.org/10.1007/b95340Action; Extensible Markup Language (XML); Revision; XQuery; database; modeling; programming; programming la作者: 赤字 時間: 2025-3-30 02:26 作者: Neuralgia 時間: 2025-3-30 05:59 作者: 人類的發(fā)源 時間: 2025-3-30 11:30
Avoiding Unnecessary Ordering Operations in XPath expressions are unnecessary. Additionally we define a deterministic automaton that illustrates how these rules can be translated into an efficient algorithm. This work is an important first step in the understanding and tackling of XPath/XQuery optimization problems that are related to ordering and duplicate removal.作者: maudtin 時間: 2025-3-30 12:52
Modelling Dynamic Web Data, and an extension of the .-calculus with process mobility and with an operation for interacting with data. Our model can be used to reason about behaviour found in, for example, dynamic web page programming, applet interaction, and service orchestration. We study behavioural equivalences for X., motivated by examples.作者: 創(chuàng)作 時間: 2025-3-30 17:39
Georg Lausen,Dan SuciuIncludes supplementary material: 作者: Fibrillation 時間: 2025-3-31 00:37
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263373.jpg作者: FELON 時間: 2025-3-31 02:34 作者: LEVY 時間: 2025-3-31 08:55 作者: ARM 時間: 2025-3-31 10:38
Andrea Eugenio Cavanna,Andrea Nani their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem. Finally, we establish a link between XPath expressions and partial tree descriptions which are studied in comput作者: Hearten 時間: 2025-3-31 14:50
Andrea Eugenio Cavanna,Andrea Naniuery is . in another if the annotated output of the former is contained in the latter on every possible annotated input databases. We study the relationship between query containment and annotation-containment and show that annotation-containment is a more refined notion in general. As a consequence作者: 陰謀小團體 時間: 2025-3-31 18:46
https://doi.org/10.1007/978-94-007-6001-1 expressions are unnecessary. Additionally we define a deterministic automaton that illustrates how these rules can be translated into an efficient algorithm. This work is an important first step in the understanding and tackling of XPath/XQuery optimization problems that are related to ordering and作者: Spinal-Tap 時間: 2025-4-1 00:58
An Epistemology for Phenomenology?y are proved. An implementation technique for incorporating constraints into the existing Java technology is developed, and a sophisticated theorem prover technology is integrated into this environment capable of enforcing behavioral compatibility and verifying transaction safety. The model of Java 作者: 藝術(shù) 時間: 2025-4-1 03:34
https://doi.org/10.1007/978-94-007-6001-1ks to ensure that data are consistent with respect to the application’s and the database’s requirements. This explicit hand-coding of integrity constraint checks is error-prone and results in less maintainable code when the integrity constraints on the application or the database change. We describe
