958 search results - page 101 / 192 » Efficient data structures for range-aggregate queries on tre... |
140
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
EDBT
2000
ACM
15 years 2 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...
ICDE
2010
IEEE
15 years 2 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
139
click to vote
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizi...