Sciweavers

110 search results - page 7 / 22
» Maintaining Data Cubes under Dimension Updates
Sort
View
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
14 years 2 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...
PDIS
1996
IEEE
13 years 11 months ago
The Strobe Algorithms for Multi-Source Warehouse Consistency
A warehouse is a data repository containing integrated information for e cient querying and analysis. Maintaining the consistency of warehouse data is challenging, especially if t...
Yue Zhuge, Hector Garcia-Molina, Janet L. Wiener
VLDB
2004
ACM
144views Database» more  VLDB 2004»
14 years 7 months ago
Preserving mapping consistency under schema changes
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
Yannis Velegrakis, Renée J. Miller, Lucian Popa
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
14 years 1 months ago
Online View Maintenance Under a Response-Time Constraint
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
Kamesh Munagala, Jun Yang 0001, Hai Yu