6846 search results - page 1105 / 1370 » Querying a summary of database |
363
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
216
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
254
click to vote
VLDB
2008
ACM
16 years 7 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
283
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
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...