2514 search results - page 159 / 503 » On the Computation of Approximations of Database Queries |
279
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
194
click to vote
SIBGRAPI
2008
IEEE
16 years 27 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
153
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Spreadsheets are among the most commonly used applications for data management and analysis. Perhaps they are even among the most widely used computer applications of all kinds. H...
175
click to vote
SARA
2007
Springer
16 years 19 days ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
173
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...