621 search results - page 99 / 125 » Efficient algorithms for minimizing tree pattern queries |
PODS
2006
ACM
14 years 8 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper, an optimal relevance algorithm is proposed, which adapts the response of a content-based image retrieval (CBIR) system to the user's information needs. In part...
TCAD
2008
13 years 7 months ago
2008
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rate...