964 search results - page 91 / 193 » Efficiently Ordering Query Plans for Data Integration |
153
Voted
CNSR
2004
IEEE
15 years 8 months ago
2004
IEEE
A fundamental problem that confronts future applications of sensor networks is how to efficiently locate the sensor node that stores a particular data item. It is known that distr...
119
Voted
VLDB
2002
ACM
15 years 4 months ago
2002
ACM
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
277
Voted
DAWAK
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
200
Voted
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-integration systems that also offer uniform access to heterogeneous data sources, dataspac...
173
click to vote
DATESO
2008
15 years 6 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...