Sciweavers

423 search results - page 51 / 85
» On Multiple Query Optimization in Data Mining
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 10 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
CIKM
2009
Springer
14 years 2 months ago
Exploring relevance for clicks
Mining feedback information from user click-through data is an important issue for modern Web retrieval systems in terms of architecture analysis, performance evaluation and algor...
Rongwei Cen, Yiqun Liu, Min Zhang, Bo Zhou, Liyun ...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 7 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 12 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
ICDE
2006
IEEE
108views Database» more  ICDE 2006»
14 years 9 months ago
Skyline Queries Against Mobile Lightweight Devices in MANETs
Skyline queries are well suited when retrieving data according to multiple criteria. While most previous work has assumed a centralized setting this paper considers skyline queryi...
Zhiyong Huang, Christian S. Jensen, Hua Lu, Beng C...