621 search results - page 6 / 125 » Efficient algorithms for minimizing tree pattern queries |
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
DASFAA
2009
IEEE
14 years 2 months ago
2009
IEEE
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
SEMWEB
2005
Springer
14 years 1 months ago
2005
Springer
Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extens...
JACM
2008
13 years 8 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...