Computational complexity of inclusion queries over polyhedral sets.
Pavlos EirinakisSalvatore RuggieriK. SubramaniPiotr J. WojciechowskiPublished in: ISAIM (2012)
Keyphrases
- computational complexity
- query processing
- query language
- response time
- web search engines
- np complete
- convex sets
- database
- special case
- computational cost
- efficient processing
- convex hull
- candidate set
- query logs
- np hard
- range queries
- query evaluation
- computational efficiency
- database queries
- data sources
- high computational complexity
- answering queries
- memory requirements
- result set
- user queries
- binary relations
- boolean operators