Sciweavers

7593 search results - page 482 / 1519
» Querying XML Databases
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
WOLLIC
2009
Springer
16 years 1 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
16 years 13 days ago
Bounds for Error Reduction with Few Quantum Queries
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...
CHOROCHRONOS
2003
Springer
16 years 3 days ago
Access Methods and Query Processing Techniques
Adriano Di Pasquale, Luca Forlizzi, Christian S. J...