1709 search results - page 37 / 342 » Comparing the Performance of Database Selection Algorithms |
229
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
BTW
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...
124
click to vote
WSDM
2012
ACM
13 years 10 months ago
2012
ACM
Given a database with missing or uncertain content, our goal is to correct and fill the database by extracting specific information from a large corpus such as the Web, and to d...
104
click to vote
PVLDB
2010
15 years 26 days ago
2010
We describe an automatic database design tool that exploits correlations between attributes when recommending materialized views (MVs) and indexes. Although there is a substantial...
132
click to vote
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...