Sciweavers

4438 search results - page 686 / 888
» Speculative Query Processing
Sort
View
VLDB
1999
ACM
107views Database» more  VLDB 1999»
15 years 10 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
SSDBM
1998
IEEE
101views Database» more  SSDBM 1998»
15 years 10 months ago
Specifications for Efficient Indexing in Spatiotemporal Databases
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
Yannis Theodoridis, Timos K. Sellis, Apostolos Pap...
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
15 years 10 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
VLDB
1994
ACM
148views Database» more  VLDB 1994»
15 years 10 months ago
Fast Incremental Indexing for Full-Text Information Retrieval
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
Eric W. Brown, James P. Callan, W. Bruce Croft
VLDB
1994
ACM
102views Database» more  VLDB 1994»
15 years 10 months ago
Reasoning About Spatial Relationships in Picture Retrieval Systems
In this paper, we consider various spatial relationships that are of general interest in pictorial database systems. We present a set of rules that allow us to deduce new relation...
A. Prasad Sistla, Clement T. Yu, R. Haddad