Sciweavers

168 search results - page 12 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 5 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
14 years 9 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
GIS
1999
ACM
14 years 4 days ago
Improved Bulk-Loading Algorithms for Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involv...
Gísli R. Hjaltason, Hanan Samet
PVLDB
2010
84views more  PVLDB 2010»
13 years 6 months ago
Processing Top-k Join Queries
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
Minji Wu, Laure Berti-Equille, Amélie Maria...
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
14 years 9 months ago
Nearest Surrounder Queries
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong