Sciweavers

36 search results - page 3 / 8
» Execution strategies for SQL subqueries
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
15 years 11 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano
HPCC
2005
Springer
15 years 3 months ago
Distributed Query Optimization in the Stack-Based Approach
Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
Hanna Kozankiewicz, Krzysztof Stencel, Kazimierz S...
VLDB
1995
ACM
214views Database» more  VLDB 1995»
15 years 1 months ago
Dynamic Multi-Resource Load Balancing in Parallel Database Systems
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
Erhard Rahm, Robert Marek
BNCOD
2003
127views Database» more  BNCOD 2003»
14 years 11 months ago
Performance Evaluation and Analysis of K-Way Join Variants for Association Rule Mining
Data mining aims at discovering important and previously unknown patterns from the dataset in the underlying database. Database mining performs mining directly on data stored in r...
P. Mishra, Sharma Chakravarthy
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 3 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