995 search results - page 45 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
157
Voted
COCO
2000
Springer
15 years 6 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
135
click to vote
SIGMOD
1993
ACM
15 years 6 months ago
1993
ACM
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
114
click to vote
CJ
2010
15 years 2 months ago
2010
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
206
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
DASFAA
2004
IEEE
15 years 5 months ago
2004
IEEE
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performanc...