Algebras for querying text regions: Expressive power and optimization

DOI10.1006/jcss.1998.1564zbMath0917.68054OpenAlexW2021253160MaRDI QIDQ1278037

Tova Milo, Mariano P. Consens

Publication date: 8 August 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3124576c847070eba73d819cee90c7329cf3a909

zbMATH Keywords

information retrievaltextual dataregion algebratext regions

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Related Items (3)

Deciding twig-definability of node selecting tree automata ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Optimizing the region algebra is PSPACE-complete

Cites Work

• Unnamed Item
• A uniform method for proving lower bounds on the computational complexity of logical theories
• An application of games to the completeness problem for formalized theories
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Algebras for querying text regions: Expressive power and optimization