621 search results - page 41 / 125 » Efficient algorithms for minimizing tree pattern queries |
GIS
2005
ACM
14 years 9 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
PC
2006
13 years 8 months ago
2006
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
COLING
1996
13 years 9 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...