80 search results - page 8 / 16 » Incremental query evaluation in a ring of databases |
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract Current, data-driven applications have become more dynamic in nature, with the need to respond to events generated from distributed sources or to react to information extr...
Publication
The tremendous increase in the use of cellular phones, GPS-like devices, and RFIDs results in highly dynamic environments where objects as well as queries are continuously moving. ...
PVLDB
2010
13 years 5 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...