ACM Home Page
Please provide us with feedback. Feedback
An adaptive approach to indexing pervasive data
Full text PdfPdf (1.75 MB)
Source International Workshop on Data Engineering for Wireless and Mobile Access archive
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access table of contents
Santa Barbara, California, United States
Pages: 14 - 19  
Year of Publication: 2001
ISBN:1-58113-412-6
Authors
Paul Castro  Department of Computer Science, University of California, Los Angeles
Richard Muntz  Department of Computer Science, University of California, Los Angeles
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/376868.376884
What is a DOI?

ABSTRACT

In a pervasive computing world data will be scattered among millions of devices and finding the right data will be a fundamental problem. Several proposed service discovery architectures can assist applications searching for data within local boundaries but there is currently no support for global access to data. We introduce an application-level protocol VIA* for building self-organizing, distributed, hierarchical data indices that adapt to dynamic query workloads. These indices efficiently route queries to relevant devices and reduce the overall workload of the system. Adapting to the query workload, VIA* uses a “query impedance” metric to approximate the optimal hierarchy for processing the expected query workload. Distributed, “logical” nodes in the interior of the hierarchy collect information about query impedance and forward this information to “data carrying” leaf nodes that react to improve the topology of the hierarchy. We present some findings from our workload testbed that demonstrate the performance and scalability characteristics of our approach and outline our research agenda


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
P. Castro and R. Muntz. Managing Context for Smart Spaces. IEEE Personal Communications, October, 2000.
 
3
Chatschik Bisdikian, Paul Castro, Ben Greenstein, Parviz Kermani, Richard Muntz, Maria Papadopouli. Sharing Appplication Data Across Service Discovery Domains. submitted for publication. January, 2001. (available at http://mmsl.cs.ucla.edu/~castrop/via-submitted.pdf)
4
 
5
JINI(tm) Connection Technology. http://www.sun.com/jini.
 
6
Jonathan Rosenberg, Erik Gutman, Ryan Moats, and Henning Schulzrinne. WASRV Architectural Principles. Internet Draft. Internet Engineering Task Force, Feb 1998. Work in progress.
 
7
The Open Source Gateway Initiative. http://www.ogsi.org.
 
8
The Salutation consortium. http://www.salutation.org.
 
9
Universal plug and play. http://www.upnp.org.

Collaborative Colleagues:
Paul Castro: colleagues
Richard Muntz: colleagues

Peer to Peer - Readers of this Article have also read: