Sciweavers

733 search results - page 68 / 147
» An incremental space to visualize dynamic data sets
Sort
View
PVLDB
2008
136views more  PVLDB 2008»
13 years 7 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 9 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
14 years 1 days ago
Time Series Forecasting from High-Dimensional Data with Multiple Adaptive Layers
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
R. Bharat Rao, Scott Rickard, Frans Coetzee
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 8 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
EDBT
2006
ACM
266views Database» more  EDBT 2006»
14 years 8 months ago
From Analysis to Interactive Exploration: Building Visual Hierarchies from OLAP Cubes
We present a novel framework for comprehensive exploration of OLAP data by means of user-defined dynamic hierarchical visualizations. The multidimensional data model behind the OLA...
Svetlana Vinnik, Florian Mansmann