Sciweavers

471 search results - page 51 / 95
» Graphical Querying of Multidimensional Databases
Sort
View
PAKDD
2004
ACM
83views Data Mining» more  PAKDD 2004»
14 years 2 months ago
Providing Diversity in K-Nearest Neighbor Query Results
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
Anoop Jain, Parag Sarda, Jayant R. Haritsa
DOLAP
2005
ACM
13 years 10 months ago
A personalization framework for OLAP queries
OLAP users heavily rely on visualization of query answers for their interactive analysis of massive amounts of data. Very often, these answers cannot be visualized entirely and th...
Ladjel Bellatreche, Arnaud Giacometti, Patrick Mar...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 10 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
SSD
2005
Springer
122views Database» more  SSD 2005»
14 years 2 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
PODS
1998
ACM
152views Database» more  PODS 1998»
14 years 28 days ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula