Sciweavers

716 search results - page 109 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
EDBT
2000
ACM
15 years 2 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
CORR
2011
Springer
259views Education» more  CORR 2011»
14 years 6 months ago
Automatic Optimization for MapReduce Programs
The MapReduce distributed programming framework has become popular, despite evidence that current implementations are inefficient, requiring far more hardware than a traditional r...
Eaman Jahani, Michael J. Cafarella, Christopher R&...
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
15 years 6 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
14 years 9 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
GIS
2006
ACM
16 years 7 days ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...