6192 search results - page 1043 / 1239 » Structure benefits all |
314
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
278
click to vote
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
We study processing and authentication of long-running queries on outsourced data streams. In this scenario, a data owner (DO) constantly transmits its data to a service provider ...
332
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
292
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
212
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...