ACM Home Page
Please provide us with feedback. Feedback
HiPPIS: an online P2P system for efficient lookups on d-dimensional hierarchies
Full text PdfPdf (221 KB)
Source
Workshop On Web Information And Data Management archive
Proceeding of the 10th ACM workshop on Web information and data management table of contents
Napa Valley, California, USA
SESSION: System issues table of contents
Pages 63-70  
Year of Publication: 2008
ISBN:978-1-60558-260-3
Authors
Katerina Doka  National Technical University of Athens, Athens, Greece
Dimitrios Tsoumakos  National Technical University of Athens, Athens, Greece
Nectarios Koziris  National Technical University of Athens, Athens, Greece
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458502.1458513
What is a DOI?

ABSTRACT

In this paper we describe HiPPIS, a system that enables efficient storage and on-line querying of multidimensional data organized into concept hierarchies and dispersed over a network. Our scheme utilizes an adaptive algorithm that automatically adjusts the level of indexing according to the granularity of the incoming queries, without assuming any prior knowledge of the workload. Efficient roll-up and drill-down operations take place in order to maximize the performance by minimizing query flooding. Extensive experimental evaluations show that, on top of the advantages that a distributed storage offers, our method answers the large majority of incoming queries, both point and aggregate ones, without flooding the network. At the same time, it manages to preserve the hierarchical nature of data. These characteristics are maintained even after sudden shifts in the workload.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
K. Aberer, P. Cudre-Mauroux, M. Hauswirth, and T. V. Pelt. Gridvine:Building internet-scale semantic overlay networks. In International Semantic Web Conference, 2004.
 
3
APB-1 OLAP Benchmark. http://www.olapcouncil.org/.
4
 
5
M. Ester, J. Kohlhammer, and P. Kriegel. The dc-tree: A fully dynamic index structure for data warehouses. In ICDE, 2000.
 
6
FreePastry. http://freepastry.rice.edu/freepastry.
 
7
 
8
 
9
 
10
 
11
G. Koloniari and E. Pitoura. Content-based routing of path quieries in peer-to-peer systems. In EDBT, 2004.
12
 
13
B. Ooi, Y. Shu, K. Tan, and A. Zhou. PeerDB: A P2P-based System for Distributed Data Sharing. In ICDE, 2003.
 
14
T. Pitoura, N. Ntarmos, and P. Triantafillou. Replication, Load Balancing and Efficient Range Query Processing in DHTs. In EDBT, 2006.
 
15
16
17
 
18
W. Wang, H. Lu, J. Feng, and J. Yu. Condensed Cube: An Effective Approach to Reducing Data Cube Size. In ICDE, 2002.

Collaborative Colleagues:
Katerina Doka: colleagues
Dimitrios Tsoumakos: colleagues
Nectarios Koziris: colleagues