1888 search results - page 117 / 378 » Algorithms for Querying by Spatial Structure |
262
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
160
click to vote
TODS
2002
15 years 4 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
155
click to vote
FAW
2008
Springer
15 years 6 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
139
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
144
click to vote
GRID
2007
Springer
15 years 8 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...