Sciweavers

119 search results - page 17 / 24
» MiniCon: A scalable algorithm for answering queries using vi...
Sort
View
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
14 years 1 months ago
Reconstructing XML Subtrees from Relational Storage of XML documents
Numerous researchers have proposed to use relational databases to store and query XML documents. One important component of such systems is the XML subtree reconstruction, which r...
Artem Chebotko, Dapeng Liu, Mustafa Atay, Shiyong ...
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
EUROPAR
2001
Springer
14 years 3 days ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han