Sciweavers

651 search results - page 119 / 131
» Index Sets and Universal Numberings
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
14 years 8 months ago
Automated SQL tuning through trial and (sometimes) error
SQL tuning--the attempt to improve a poorly-performing execution plan produced by the database query optimizer-is a critical aspect of database performance tuning. Ironically, as ...
Herodotos Herodotou, Shivnath Babu
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 7 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
EDBT
2010
ACM
153views Database» more  EDBT 2010»
14 years 2 months ago
Suggestion of promising result types for XML keyword search
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
FOCS
2009
IEEE
14 years 2 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...