Optimizing the Region Algebra is PSPACE-complete

Authors:
Wouter Gelade;Frank Neven
Affiliations:
Hasselt University and Transnational University of Limburg, School for Information Technology, Belgium;Hasselt University and Transnational University of Limburg, School for Information Technology, Belgium
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 0

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
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
One-pass evaluation of region algebra expressions

Information Systems
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
TIJAH: Embracing IR Methods in XML Databases

Information Retrieval
Attribute grammars for unranked trees as a query language for structured documents

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.90

Visualization

Abstract

The Region Algebra is a set-at-a-time algebra for querying text regions. We show that satisfiability, inclusion, and equivalence testing of region algebra expressions are PSPACE-complete. This improves upon the previously known NP lower bounds and EXPTIME upper bounds.