491 search results - page 30 / 99 » Optimizing Large OODB Queries |
157
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
91
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
155
Voted
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
106
click to vote
JACM
2012
13 years 3 days ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...