Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Text databases: a survey of text models and systems
ACM SIGMOD Record
A language for queries on structure and contents of textual databases
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Integrating contents and structure in text retrieval
ACM SIGMOD Record
Improving index structures for structured document retrieval
IRSG'99 Proceedings of the 21st Annual BCS-IRSG conference on Information Retrieval Research
| Hi-index | 0.00 |
This paper picks up the Tree Matching approach to integrate the paradigm of structured documents into the field of Information Retrieval. The concept of Tree Matching is extended by the notion of complete answer representations (CARs), which makes it possible to avoid the combinatorial explosion in the number of solutions (and thus complexity). An algorithm is presented that combines a class of Tree Matching problems with index-based search and returns a CAR in linear time.