511 search results - page 76 / 103 » Approximate Selection Queries over Imprecise Data |
181
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
239
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
167
click to vote
SBBD
2001
15 years 7 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
303
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
169
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...