Sciweavers

VLDB
1999
ACM
107views Database» more  VLDB 1999»
13 years 8 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
VLDB
1999
ACM
80views Database» more  VLDB 1999»
13 years 8 months ago
GHOST: Fine Granularity Buffering of Indexes
Cheng Hian Goh, Beng Chin Ooi, D. Sim, Kian-Lee Ta...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 8 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
VLDB
1999
ACM
188views Database» more  VLDB 1999»
13 years 8 months ago
SPIRIT: Sequential Pattern Mining with Regular Expression Constraints
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
Minos N. Garofalakis, Rajeev Rastogi, Kyuseok Shim
VLDB
1999
ACM
87views Database» more  VLDB 1999»
13 years 8 months ago
What Do Those Weird XML Types Want, Anyway?
Steven J. DeRose
VLDB
1999
ACM
134views Database» more  VLDB 1999»
13 years 8 months ago
Capturing and Querying Multiple Aspects of Semistructured Data
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
Curtis E. Dyreson, Michael H. Böhlen, Christi...
VLDB
1999
ACM
91views Database» more  VLDB 1999»
13 years 8 months ago
Probabilistic Optimization of Top N Queries
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
Donko Donjerkovic, Raghu Ramakrishnan
VLDB
1999
ACM
89views Database» more  VLDB 1999»
13 years 8 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
VLDB
1999
ACM
188views Database» more  VLDB 1999»
13 years 8 months ago
Comparing Hierarchical Data in External Memory
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Sudarshan S. Chawathe
VLDB
1999
ACM
127views Database» more  VLDB 1999»
13 years 8 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano