1709 search results - page 39 / 342 » Comparing the Performance of Database Selection Algorithms |
156
click to vote
INFSOF
2007
15 years 4 months ago
2007
A set of mutation operators for SQL queries that retrieve information from a database is developed and tested against a set of queries drawn from the NIST SQL Conformance Test Sui...
138
click to vote
ICTAI
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
117
click to vote
EDBT
2002
ACM
16 years 4 months ago
2002
ACM
For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed a...
107
click to vote
ICDE
1990
IEEE
15 years 8 months ago
1990
IEEE
All previous multicopy algorithms require additional space for redundant information equal to the size of the object being replicated. This paper proposes a new multicopy algorith...
235
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...