Sciweavers

491 search results - page 43 / 99
» Optimizing Large OODB Queries
Sort
View
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 2 months ago
Incorporating partitioning and parallel plans into the SCOPE optimizer
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
Jingren Zhou, Per-Åke Larson, Ronnie Chaiken
CP
2009
Springer
14 years 2 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
14 years 9 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
DASFAA
2010
IEEE
190views Database» more  DASFAA 2010»
13 years 11 months ago
k-Selection Query over Uncertain Data
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
JACM
2008
91views more  JACM 2008»
13 years 7 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari