2850 search results - page 388 / 570 » Answering Queries using Humans, Algorithms and Databases |
183
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
175
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
174
click to vote
VLDB
2007
ACM
16 years 16 days ago
2007
ACM
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
282
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
173
click to vote
MTA
2007
15 years 6 months ago
2007
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...