Sciweavers

625 search results - page 86 / 125
» Genetic algorithms for large join query optimization
Sort
View
CCGRID
2005
IEEE
14 years 1 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...
DLOG
2006
13 years 9 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 9 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 2 months ago
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
Bin Cui, Hua Lu, Quanqing Xu, Lijiang Chen, Yafei ...