6974 search results - page 401 / 1395 » Querying Semi-Structured Data |
199
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
207
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
Web search components such as ranking and query suggestions analyze the user data provided in query and click logs. While this data is easy to collect and provides information abo...
318
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
286
click to vote
VLDB
2001
ACM
16 years 7 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
295
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...