An algebra for hierarchically organized text-dominated databases
Information Processing and Management: an International Journal
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
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
Algebras for querying text regions: expressive power and optimization
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Shortest-substring retrieval and ranking
ACM Transactions on Information Systems (TOIS)
Lightweight structured text processing
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Optimizing the Region Algebra is PSPACE-complete
Information Processing Letters
Efficient lazy algorithms for minimal-interval semantics
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Expressiveness and performance of full-text search languages
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
A region algebra is a set of operators that take lists of regions as inputs and return lists of regions as results. Consider evaluating an operator tree that has region lists at the leaf nodes, operators at the internal nodes, and edges representing the data flow between the operators. A simple method is to evaluate operators one at a time in a bottom-up manner starting at the leaves. This requires that intermediate results be buffered in memory or written to disk.We describe an alternative method that merges the input region lists and performs the evaluation using a single pass over this merged list. This can be more efficient than evaluating operators one at a time since intermediate results are not buffered or written to disk.