Sciweavers

243 search results - page 37 / 49
» An Iterative Method for Distributed Database Design
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
14 years 10 months ago
Towards Efficient Processing of General-Purpose Joins in Sensor Networks
Abstract-- Join processing in wireless sensor networks is difficult: As the tuples can be arbitrarily distributed within the network, matching pairs of tuples is communication inte...
Erik Buchmann, Klemens Böhm, Mirco Stern
ICDE
2006
IEEE
130views Database» more  ICDE 2006»
14 years 10 months ago
Warehousing and Analyzing Massive RFID Data Sets
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. In the near future, it is expected tha...
Hector Gonzalez, Jiawei Han, Xiaolei Li, Diego Kla...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 10 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter