Skip to main content
SpringerLink
Log in

Searchable Querical Data Networks

  • Conference paper
Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2944))

Abstract

Recently, a new family of massive self-organizing networks has emerged that not only serve as a communication infrastructure, but also mainly as a distributed query processing system. We term these networks Querical Data Networks (QDNs). Peer-to-peer networks are examples of QDN. In this paper, first we identify and characterize QDN as a new family of data networks with common characteristics and applications. Subsequently, as the first step toward realizing the evolved vision of QDN as a large-scale distributed query processing system, we propose an efficiently searchable QDN model based on a recently developed small-world model. We discuss in details how our QDN model enables effective location of the data relevant to a QDN query.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamic, L., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in power-law networks. Physics Review Letters 64(46135) (2001)

    Google Scholar 

  2. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine, 40(8) (August 2002)

    Google Scholar 

  3. Avnur, R., Hellerstein, J.M.: Eddies: continuously adaptive query processing. In: Proceedings of ACM International Conference on Management of Data (SIGMOD 2000) (May 2000)

    Google Scholar 

  4. Banaei-Kashani, F., Shahabi, C.: Criticality-based analysis and design of unstructured peer-to-peer networks as complex systems. In: Third International Workshop on Global and Peer-to-Peer Computing (GP2PC) in conjunction with CCGrid 2003 (May 2003)

    Google Scholar 

  5. Bar-Yam, Y.: Dynamics of Complex Systems. Westview Press, Boulder (1997)

    MATH  Google Scholar 

  6. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  7. Bawa, M., Manku, G., Raghavan, P.: SETS: Search enhanced by topic-segmentation. In: Proceedings of the 26th Annual International Conference on Research and Development in Informaion Retrieval, SIGIR 2003 (2003)

    Google Scholar 

  8. Crespo, A., Garcia-Molina, H.: Semantic overlay networks (in submission)

    Google Scholar 

  9. Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: Proceesings of International Conference on Mobile Computing and Networks, MobiCOM 1999 (1999)

    Google Scholar 

  10. Govindan, R., Hellerstein, J., Hong, W., Madden, S., Franklin, M., Shenker, S.: The sensor network as a database. Technical Report 02-771, University of Southern California (2002)

    Google Scholar 

  11. Gupta, A., Agrawal, D., El Abbadi, A.: Approximate range selection queries in peer-to-peer systems. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research (January 2003)

    Google Scholar 

  12. Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., Ganesan, D.: Building efficient wireless sensor networks with low-level naming. In: Proceedings of the Symposium on Operating Systems Principles (October 2001)

    Google Scholar 

  14. Huebsch, R., Lanham, N., Loo, B.T., Hellerstein, J.M., Shenker, S., Stoica, I.: Querying the inernet with PIER. In: Proceedings of 29th International Conference on Very Large Data Bases, VLDB 2003 (2003)

    Google Scholar 

  15. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Technical Report 99-1776, Cornell University (2000)

    Google Scholar 

  16. Krishnamachari, B., Estrin, D., Wicker, S.: Modelling data-centric routing in wireless sensor networks. In: Proceedings of INFOCOM 2002 (June 2002)

    Google Scholar 

  17. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th International Conference on supercomputing (ICS 2002) (June 2002)

    Google Scholar 

  18. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks. In: Proceedings of 5th Annual Symposium on Operating Systems Design and Implementation (OSDI) (December 2002)

    Google Scholar 

  19. Ratnasamy, S., Estrin, D., Govindan, R., Karp, B., Shenker, S., Yin, L., Yu, F.: Data-centric storage in sensornets. In: Proceedings of SIGCOMM 2002 (2002)

    Google Scholar 

  20. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001 (August 2001)

    Google Scholar 

  21. Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., Shenker, S.: GHT: A Geographic Hash Table for data-centric storage in sensornets. In: Proceedings of the First Workshop on Sensor Networks and Applications, WSNA (2002)

    Google Scholar 

  22. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware) (November 2001)

    Google Scholar 

  23. Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: A scalable and ontology-based p2p infrastructure for semantic web services. In: Proceedings of the 2nd International Workshop on Agents and Peer-to-Peer Computing (2002)

    Google Scholar 

  24. Schmidt, R.R., Shahabi, C.: How to evaluate multiple range-sum queries progressively. In: 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2002) (June 2002)

    Google Scholar 

  25. Schmidt, R.R., Shahabi, C.: ProPolyne: A fast wavelet-based algorithm for progressive evaluation of polynomial range-sum queries. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, p. 664. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  26. Shen, C., Srisathapornphat, C., Jaikaeo, C.: Sensor information networking architecture and applications. IEEE Personel Communication Magazine 8(4), 52–59 (2001)

    Article  Google Scholar 

  27. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM 2001 (August 2001)

    Google Scholar 

  28. Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425–443 (1969)

    Article  Google Scholar 

  29. Watts, D.J., Dodds, P.S., Newman, M.E.J.: Identity and search in social networks. Science 296, 1302–1305 (2002)

    Article  Google Scholar 

  30. Yao, Y., Gehrke, J.: Query processing in sensor networks. In: Proceedings of the Conference on Innovative Data Systems Research (CIDR) (January 2003)

    Google Scholar 

  31. Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UCB (April 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Southern California, Los Angeles, California, 90089

    Farnoush Banaei-Kashani & Cyrus Shahabi

Authors
  1. Farnoush Banaei-Kashani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyrus Shahabi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne (EPFL), CH-1015, Lausanne, Switzerland

    Karl Aberer

  2. National and Kapodistrian University of Athens, Greece

    Manolis Koubarakis

  3. Department of Computer Science and Engineering, University of California, Riverside, 92521, Riverside, CA

    Vana Kalogeraki

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banaei-Kashani, F., Shahabi, C. (2004). Searchable Querical Data Networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24629-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20968-3

  • Online ISBN: 978-3-540-24629-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation