Sciweavers

9683 search results - page 632 / 1937
» Predicting query performance
Sort
View
DOLAP
2005
ACM
15 years 9 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
LREC
2008
90views Education» more  LREC 2008»
15 years 8 months ago
A Text-based Query Interface to OWL Ontologies
Accessing structured data in the form of ontologies requires training and learning formal query languages (e.g., SeRQL or SPARQL) which poses significant difficulties for non-expe...
Danica Damljanovic, Valentin Tablan, Kalina Bontch...
DKE
2006
123views more  DKE 2006»
15 years 7 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
IJCSA
2007
143views more  IJCSA 2007»
15 years 7 months ago
Incremental Trade-Off Management for Preference-Based Queries
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...
195
Voted
INFSOF
2007
98views more  INFSOF 2007»
15 years 7 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung