Optimizing the region algebra is PSPACE-complete

DOI10.1016/J.IPL.2010.05.006zbMATH Open1234.68134OpenAlexW2170148220MaRDI QIDQ765502FDOQ765502

Frank Neven, Wouter Gelade

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/10916

zbMATH Keywords

computational complexitydatabasesregion algebra

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Cites Work

• Algebras for querying text regions: Expressive power and optimization
• Attribute grammars for unranked trees as a query language for structured documents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Optimizing the region algebra is PSPACE-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765502)