Sciweavers

354 search results - page 14 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
ADBIS
2000
Springer
91views Database» more  ADBIS 2000»
14 years 2 days ago
Efficient Region Query Processing by Optimal Page Ordering
A number of algorithms of clustering spatial data for reducing the number of disk seeks required to process spatial queries have been developed. One of the algorithms is the scheme...
Daesoo Cho, Bonghee Hong
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 8 months ago
javax.XXL: A prototype for a Library of Query processing Algorithms
In this paper we describe XXL (eXtensible and fleXible Library), a toolkit for rapid prototyping query processing algorithms. XXL is a flexible, high-level, platform independent J...
Jochen Van den Bercken, Jens-Peter Dittrich, Bernh...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 8 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 2 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
GIS
2005
ACM
14 years 9 months ago
Finding corresponding objects when integrating several geo-spatial datasets
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...
Catriel Beeri, Yerach Doytsher, Yaron Kanza, Eliya...