Sciweavers

2001 search results - page 69 / 401
» Indexing in a Hypertext Database
Sort
View
SPIRE
2001
Springer
14 years 1 months ago
Distributed Query Processing Using Partitioned Inverted Files
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
Claudine Santos Badue, Ricardo A. Baeza-Yates, Ber...
DAWAK
2000
Springer
14 years 1 months ago
Optimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
Stefan Berchtold, Christian Böhm, Daniel A. K...
BTW
2003
Springer
76views Database» more  BTW 2003»
14 years 2 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
VLDB
1998
ACM
77views Database» more  VLDB 1998»
14 years 1 months ago
Safely and Efficiently Updating References During On-line Reorganization
With today's demands for continuous availability of mission-critical databases, on-line reorganization is a necessity. In this paper we present a new on-Iine reorganization a...
Chendong Zou, Betty Salzberg
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 3 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...