Efficient evaluation of specific queries in constraint databases

DOI10.1016/j.ipl.2011.06.015zbMath1260.68135OpenAlexW2080105954MaRDI QIDQ1944172

Joos Heintz, Rafael Grimson, Bart Kuijpers

Publication date: 4 April 2013

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

Full work available at URL: http://hdl.handle.net/11336/115004

zbMATH Keywords

computational complexityconstraint databasesquery evaluation

Mathematics Subject Classification ID

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

Related Items (1)

Evaluating geometric queries using few arithmetic operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point location in arrangements of hyperplanes
• Topological complexity of the range searching
• A note on point location in arrangements of hyperplanes
• An algorithm for generalized point location and its applications
• Improved Algorithms for Sign Determination and Existential Quantifier Elimination
• A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
• Algorithms in real algebraic geometry

This page was built for publication: Efficient evaluation of specific queries in constraint databases