208 search results - page 29 / 42 » Indexing range sum queries in spatio-temporal databases |
XIMEP
2005
ACM
14 years 1 months ago
2005
ACM
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
PODS
1998
ACM
13 years 12 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
MTA
1998
13 years 7 months ago
1998
We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional...