74 search results - page 6 / 15 » Index Structures for Matching XML Twigs Using Relational Que... |
DAWAK
1999
Springer
13 years 12 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...
TDM
2004
13 years 9 months ago
2004
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Te...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
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. ...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...