Sciweavers

6846 search results - page 327 / 1370
» Querying a summary of database
Sort
View
BTW
2003
Springer
76views Database» more  BTW 2003»
15 years 12 months ago
Partitioned B-trees - a user's guide
: A recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually ...
Goetz Graefe
PODS
1991
ACM
93views Database» more  PODS 1991»
15 years 10 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
16 years 23 days ago
Finding Syntactic Similarities Between XML Documents
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
Davood Rafiei, Daniel L. Moise, Dabo Sun
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
16 years 6 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya
LAWEB
2005
IEEE
16 years 8 days ago
Optimized Index Structures for Querying RDF from the Web
Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for th...
Andreas Harth, Stefan Decker