505 search results - page 87 / 101 » Queries with Incomplete Answers over Semistructured Data |
119
click to vote
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
112
Voted
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
105
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: Neuroscientists often need to access a wide range of data sets distributed over the Internet. These data sets, however, are typically neither integrated nor interopera...
131
click to vote
SIGMOD
2012
ACM
13 years 1 days ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
129
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...