作者: A簡潔的 時間: 2025-3-21 21:01 作者: 跳動 時間: 2025-3-22 02:51
Datalog Programs over Infinite Databases, Revisited setting, and the results obtained here were used in a practical database problem. In the course of implementing a database system for querying Java software, we found that the universe of Java code can be effectively modeled as an infinite database. This modeling makes it possible to distinguish be作者: 搖曳 時間: 2025-3-22 06:02
A?Methodology?for?Coupling?Fragments?of?XPath with Structural Indexes for XML Documentsabeled trees which match portions of the hierarchical XML data. In XPath query evaluation, indices similar to those used in relational database systems - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be作者: PANG 時間: 2025-3-22 12:10 作者: FANG 時間: 2025-3-22 14:21
A Better Semantics for XQuery with Side-Effectsilation. We substantiate this claim by formalizing the compilation of XQuery extended with updates into a database algebra. We prove the correctness of the proposed compilation by mapping both the source language and the algebra to a common core language with list comprehensions and extensible tuple作者: FANG 時間: 2025-3-22 18:45
Repairing Inconsistent XML Write-Access Control Policies a sequence of allowed operations. This paper investigates the problem of deciding whether a policy is consistent, and if not, how its inconsistencies can be repaired. We consider policies expressed in terms of annotated DTDs defining which operations are allowed or denied for the XML trees that are作者: 喃喃訴苦 時間: 2025-3-22 22:20 作者: 高腳酒杯 時間: 2025-3-23 03:21 作者: 在駕駛 時間: 2025-3-23 06:55 作者: oblique 時間: 2025-3-23 13:17 作者: 制度 時間: 2025-3-23 17:40
Querying Structural and Behavioral Properties of Business Processesss processes as rewriting systems, an abstraction of the emerging BPEL (Business Process Execution Language) standard [7]. BPQL allows users to query business processes visually, in a manner very analogous to the language used to specify the processes. The goal of the present paper is to study the f作者: septicemia 時間: 2025-3-23 21:31 作者: 終點 時間: 2025-3-23 23:17 作者: ERUPT 時間: 2025-3-24 06:24
Analysis of Imperative XML Programsalyzing and optimizing imperative XML processing programs. In particular, we present a program analysis, based on a flow-sensitive type system, for detecting both redundant computations and redundant traversals in XML processing programs. The analysis handles declarative queries over XML data and im作者: Resistance 時間: 2025-3-24 09:09 作者: Accolade 時間: 2025-3-24 10:41
Towards Practical Typechecking for Macro Tree Transducerser reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input type obtained from a backward inference as an alternating tree automaton, in a style similar to Tozawa’s XSLT0 typechecking. In this approach, typechecking red作者: BOGUS 時間: 2025-3-24 15:58
https://doi.org/10.1007/978-1-349-07274-3nt. The algorithm is in LOGCFL and space consumption is strongly bounded, while the running time is linear in the size of the data tree. This algorithm immediately generalizes to the problem of matching the tree pattern against all subtrees of the data tree, preserving the mentioned efficiency properties.作者: GNAW 時間: 2025-3-24 19:52
and the Short Stories of 1910–11ast-privilege” consistent total policies. We also consider repair problems based on deleting privileges to restore consistency, show that finding minimal repairs is .-complete, and give heuristics for finding repairs.作者: diathermy 時間: 2025-3-25 00:11
Marlow’s Initial Response to Jimive to three kinds of vertical pattern languages: regular, linear, and strongly linear patterns. We also consider the complexity of the simplification problem for each of the considered pattern-based schema’s.作者: 衍生 時間: 2025-3-25 06:55 作者: 冬眠 時間: 2025-3-25 07:58
Efficient Algorithms for the Tree Homeomorphism Problemnt. The algorithm is in LOGCFL and space consumption is strongly bounded, while the running time is linear in the size of the data tree. This algorithm immediately generalizes to the problem of matching the tree pattern against all subtrees of the data tree, preserving the mentioned efficiency properties.作者: 虛度 時間: 2025-3-25 13:43
Repairing Inconsistent XML Write-Access Control Policiesast-privilege” consistent total policies. We also consider repair problems based on deleting privileges to restore consistency, show that finding minimal repairs is .-complete, and give heuristics for finding repairs.作者: happiness 時間: 2025-3-25 17:07 作者: Medley 時間: 2025-3-25 21:00 作者: 高深莫測 時間: 2025-3-26 03:12
A?Methodology?for?Coupling?Fragments?of?XPath with Structural Indexes for XML Documentss - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices.作者: Epidural-Space 時間: 2025-3-26 07:56
A Theory of Stream Queriesues investigated include abstract definitions of computability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and bounded memory computability of stream queries using abstract state machines (ASMs).作者: GULF 時間: 2025-3-26 11:48 作者: 掃興 時間: 2025-3-26 14:12
https://doi.org/10.1007/978-1-349-05189-2t the color algebra is relationally complete: it is equivalent to the relational algebra on the explicit annotations. Our result extends a similar completeness result established for the query algebra of the MONDRIAN annotation system, from unions of conjunctive queries to the full relational algebra.作者: reptile 時間: 2025-3-26 19:29
Conrad’s shorter fiction: 1901–1902dation for forms of provenance that are intended to show how (part of) the output of a query depends on (parts of) its input. We introduce a semantic characterization of such ., show that this form of provenance is not computable, and provide dynamic and static approximation techniques.作者: deforestation 時間: 2025-3-26 22:50 作者: Efflorescent 時間: 2025-3-27 05:02
https://doi.org/10.1007/978-1-349-05189-2own classes and discover new ones. Finally, we use an Ehrenfeucht-Fra?ssé game to show the non-existence of a consistent FO rewriting for (the existential closure of) ., where . is a constant and the first coordinate of . is the primary key.作者: senile-dementia 時間: 2025-3-27 08:52 作者: 偽造 時間: 2025-3-27 13:14 作者: Trochlea 時間: 2025-3-27 13:38
https://doi.org/10.1007/978-981-10-7623-7r checking emptiness of alternating tree automata, where we exploit the explicit representation of alternation for local optimizations. Our preliminary experiments confirm that our algorithm has a practical performance that can typecheck simple transformations with respect to the full XHTML in a reasonable time.作者: 興奮過度 時間: 2025-3-27 19:51 作者: 只有 時間: 2025-3-28 01:59
Querying Structural and Behavioral Properties of Business Processesbe applied uniformly to queries on the . of the process specification as well as on the potential . of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.作者: reptile 時間: 2025-3-28 05:28 作者: 陳列 時間: 2025-3-28 07:28
Towards Practical Typechecking for Macro Tree Transducersr checking emptiness of alternating tree automata, where we exploit the explicit representation of alternation for local optimizations. Our preliminary experiments confirm that our algorithm has a practical performance that can typecheck simple transformations with respect to the full XHTML in a reasonable time.作者: 占卜者 時間: 2025-3-28 10:50 作者: sclera 時間: 2025-3-28 17:34 作者: guardianship 時間: 2025-3-28 20:42 作者: FLORA 時間: 2025-3-29 01:43
Provenance as Dependency Analysisdation for forms of provenance that are intended to show how (part of) the output of a query depends on (parts of) its input. We introduce a semantic characterization of such ., show that this form of provenance is not computable, and provide dynamic and static approximation techniques.作者: tendinitis 時間: 2025-3-29 04:24
Efficient Inclusion for a Class of XML Types with Interleaving and Countingpe into a set of constraints that completely characterizes the type. We then provide a complete deduction system to verify whether the constraints of one type imply all the constraints of another one.作者: Herd-Immunity 時間: 2025-3-29 10:03 作者: 喧鬧 時間: 2025-3-29 15:05
and the Short Stories of 1910–11s - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices.作者: Annotate 時間: 2025-3-29 19:21
https://doi.org/10.1007/978-1-349-05274-5ues investigated include abstract definitions of computability of stream queries; the connection between abstract computability, continuity, monotonicity, and non-blocking operators; and bounded memory computability of stream queries using abstract state machines (ASMs).作者: 不可侵犯 時間: 2025-3-29 22:00
Datalog Programs over Infinite Databases, Revisitedthm to generate an efficient evaluation scheme of closed queries, which is a generalization of Vieille’s famous QSQR algorithm for top-down evaluation of Datalog programs. A by-product of this work is a rather terse and elegant representation of QSQR.作者: gruelling 時間: 2025-3-30 01:34 作者: 溝通 時間: 2025-3-30 06:08
0302-9743 carried out extensive d- cussions during the electronic PC meeting. We are grateful to Andrei Voronkov for his EasyChair system that made it so easy to manage 978-3-540-75986-7978-3-540-75987-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 小丑 時間: 2025-3-30 10:03 作者: NUDGE 時間: 2025-3-30 12:30 作者: 小步舞 時間: 2025-3-30 17:39 作者: Clumsy 時間: 2025-3-30 21:57
https://doi.org/10.1007/978-1-349-07274-3ilation. We substantiate this claim by formalizing the compilation of XQuery extended with updates into a database algebra. We prove the correctness of the proposed compilation by mapping both the source language and the algebra to a common core language with list comprehensions and extensible tuples.作者: glans-penis 時間: 2025-3-31 02:46
and the Short Stories of 1904–7erface of a traditional database. This paper aims to provide an overview of recent advances in XML publishing. We present a notion of publishing transducers recently developed for studying the expressive power and complexity of XML publishing languages. In terms of publishing transducers we then cha作者: 自愛 時間: 2025-3-31 08:45
https://doi.org/10.1007/978-1-349-07274-3ination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorphism is LOGSPACE-complete, improving on the current LO作者: magnate 時間: 2025-3-31 11:49
https://doi.org/10.1007/978-1-349-07274-3 setting, and the results obtained here were used in a practical database problem. In the course of implementing a database system for querying Java software, we found that the universe of Java code can be effectively modeled as an infinite database. This modeling makes it possible to distinguish be作者: 咒語 時間: 2025-3-31 13:50
