707 search results - page 81 / 142 » Processing queries on tree-structured data efficiently |
SIGMOD
2007
ACM
14 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...
OTM
2004
Springer
14 years 2 months ago
2004
Springer
Exceptionally large amounts of both distributed data and computational resources are becoming available through the Grid. This will enable efficient exchange and processing of very...
BTW
2009
Springer
13 years 9 months ago
2009
Springer
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
JSS
2008
13 years 8 months ago
2008
Many state-of-the-art selectivity estimation methods use query feedback to maintain histogram buckets, thereby using the limited memory efficiently. However, they are "reacti...
DAWAK
1999
Springer
14 years 1 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...