513 search results - page 15 / 103 » Cache Conscious Algorithms for Relational Query Processing |
ADBIS
1998
Springer
13 years 11 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
MOBIDE
2003
ACM
14 years 19 days ago
2003
ACM
This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches loca...
JCSS
2008
13 years 7 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
GVD
2003
13 years 8 months ago
2003
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...