439 search results - page 38 / 88 » Unnesting Arbitrary Queries |
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
LOGCOM
2007
13 years 9 months ago
2007
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
DPD
2006
13 years 10 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
Detecting bursts in data streams is an important and challenging task. Due to the complexity of this task, usually burst detection cannot be formulated using standard query operat...
HPDC
2003
IEEE
14 years 3 months ago
2003
IEEE
We describe the XenoSearch system for performing expressive resource discovery searches in a distributed environment. We represent server meta-data, such as their locations and fa...