Sciweavers

164 search results - page 6 / 33
» The performance of SQL queries to an X.500 directory system
Sort
View
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 1 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
PVLDB
2010
191views more  PVLDB 2010»
13 years 6 months ago
SnipSuggest: Context-Aware Autocompletion for SQL
In this paper, we present SnipSuggest, a system that provides onthe-go, context-aware assistance in the SQL composition process. SnipSuggest aims to help the increasing population...
Nodira Khoussainova, YongChul Kwon, Magdalena Bala...
SIGMOD
2005
ACM
228views Database» more  SIGMOD 2005»
14 years 7 months ago
ConQuer: Efficient Management of Inconsistent Databases
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
Ariel Fuxman, Elham Fazli, Renée J. Miller
VLDB
1999
ACM
107views Database» more  VLDB 1999»
13 years 12 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
IQIS
2007
ACM
13 years 9 months ago
On the performance of one-to-many data transformations
Relational Database Systems often support activities like data warehousing, cleaning and integration. All these activities require performing some sort of data transformations. Si...
Paulo J. F. Carreira, Helena Galhardas, Joã...