166 search results - page 1 / 34 » Extending the Search Strategy in a Query Optimizer |
VLDB
1991
ACM
13 years 8 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
DEXAW
2010
IEEE
13 years 6 months ago
2010
IEEE
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
ICDE
2006
IEEE
13 years 11 months ago
2006
IEEE
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...