Sciweavers

483 search results - page 46 / 97
» Evaluating Top-k Selection Queries
Sort
View
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
ER
2008
Springer
110views Database» more  ER 2008»
13 years 9 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
TIP
2010
90views more  TIP 2010»
13 years 2 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
ICDE
2006
IEEE
169views Database» more  ICDE 2006»
14 years 9 months ago
Scalable Exploration of Physical Database Design
Physical database design is critical to the performance of a large-scale DBMS. The corresponding automated design tuning tools need to select the best physical design from a large...
Arnd Christian König, Shubha U. Nabar
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 7 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...