1888 search results - page 195 / 378 » Algorithms for Querying by Spatial Structure |
174
click to vote
EDBT
1992
ACM
15 years 7 months ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
231
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
120
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
135
click to vote
CORR
2012
Springer
13 years 12 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
156
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...