Sciweavers

964 search results - page 22 / 193
» Efficiently Ordering Query Plans for Data Integration
Sort
View
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 8 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
16 years 5 months ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 5 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 8 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
BMCBI
2007
134views more  BMCBI 2007»
15 years 4 months ago
PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
Ji He, Xinbin Dai, Xuechun Zhao