Sciweavers

785 search results - page 22 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
DATESO
2009
119views Database» more  DATESO 2009»
13 years 6 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
SIGMOD
2008
ACM
126views Database» more  SIGMOD 2008»
14 years 9 months ago
On efficient top-k query processing in highly distributed environments
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
ISPAN
2002
IEEE
14 years 1 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar
DAGSTUHL
2006
13 years 10 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 9 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi