2859 search results - page 296 / 572 » Querying Complex Structured Databases |
260
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
252
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
178
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
205
click to vote
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
155
click to vote
ICDT
1999
ACM
15 years 11 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...