Sciweavers

Share
ICDT
2007
ACM
158views Database» more  ICDT 2007»
10 years 3 months ago
Coupling Fragments of XPath with XML Indexing and Query Decomposition
Abstract. Recent studies have proposed structural summary techniques for pathquery evaluation on semi-structured data sources. One major line of this research
George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, ...
ICDT
2007
ACM
117views Database» more  ICDT 2007»
10 years 3 months ago
Preferentially Annotated Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the i...
Gösta Grahne, Alex Thomo, William W. Wadge
ICDT
2007
ACM
112views Database» more  ICDT 2007»
10 years 3 months ago
Commutativity Analysis in XML Update Languages
Abstract. A common approach to XML updates is to extend XQuery with update operations. This approach results in very expressive languages which are convenient for users but are dif...
Giorgio Ghelli, Kristoffer Høgsbro Rose, J&...
ICDT
2007
ACM
81views Database» more  ICDT 2007»
10 years 3 months ago
Constant-Memory Validation of Streaming XML Documents Against DTDs
In this paper we investigate the problem of validating, with constant memory, streaming XML documents with respect to a DTD. Such constant memory validations can only be performed ...
Luc Segoufin, Cristina Sirangelo
ICDT
2007
ACM
96views Database» more  ICDT 2007»
10 years 3 months ago
The Limits of Querying Ontologies
Riccardo Rosati
ICDT
2007
ACM
107views Database» more  ICDT 2007»
10 years 3 months ago
Privacy in GLAV Information Integration
Abstract. We define and study formal privacy guarantees for information integration systems, where sources are related to a public schema by mappings given by source-to-target dep...
Alan Nash, Alin Deutsch
ICDT
2007
ACM
121views Database» more  ICDT 2007»
10 years 3 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin
ICDT
2007
ACM
141views Database» more  ICDT 2007»
10 years 3 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ICDT
2007
ACM
107views Database» more  ICDT 2007»
10 years 3 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
ICDT
2007
ACM
106views Database» more  ICDT 2007»
10 years 3 months ago
Trajectory Databases: Data Models, Uncertainty and Complete Query Languages
Moving objects produce trajectories. We describe a data model for trajectories and trajectory samples and an efficient way of modeling uncertainty via beads for trajectory samples....
Bart Kuijpers, Walied Othman
books