511 search results - page 12 / 103 » Approximate Selection Queries over Imprecise Data |
218
click to vote
ISEMANTICS
2010
15 years 4 months ago
2010
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...
154
Voted
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
164
click to vote
SSDBM
2008
IEEE
15 years 12 months ago
2008
IEEE
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
267
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
158
Voted
SCCC
2003
IEEE
15 years 11 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...