Sciweavers

6846 search results - page 265 / 1370
» Querying a summary of database
Sort
View
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
BTW
2007
Springer
142views Database» more  BTW 2007»
16 years 24 days ago
Visually Exploring and Querying XML with BaseX
Abstract: XML documents are widely used as a generic container for textual contents. As they are increasingly growing in size, XML databases have come up to efficiently store and q...
Christian Grün, Alexander Holupirek, Marc H. ...
BXML
2003
15 years 8 months ago
Querying transformed XML documents: Determining a sufficient fragment of the original document
Large XML documents which are stored in an XML database can be transformed further by an XSL processor using an XSLT stylesheet. In order to answer an XPath query based on the tran...
Sven Groppe, Stefan Böttcher
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 4 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...