Sciweavers

126 search results - page 12 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
ICDT
2012
ACM
293views Database» more  ICDT 2012»
12 years 8 hour ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
PODS
2012
ACM
297views Database» more  PODS 2012»
12 years 1 days ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
14 years 3 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 9 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li