Skip to main content
SpringerLink
Log in
Book cover

Australasian Database Conference

ADC 2014: Databases Theory and Applications pp 189–197Cite as

A Functional Database Representation of Large Sets of Objects

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8506))

Abstract

This paper explores a novel way of implementing set-valued operators that are used in analysis and retrieval in large social networks. The software we describe has been implemented and thoroughly tested in several demanding applications.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonin, J.E., Oxley, J.G., Servatius, B. (eds.): Matroid Theory. Contemporary Mathematics, p. 197. Amer. Math. Soc., Providence (1995)

    Google Scholar 

  2. Dekker, A.: Conceptual Distance in Social Network Analysis. J. of Social Structure 6(3), 1–31 (2006)

    Google Scholar 

  3. Edelman, P.H., Jamison, R.E.: The Theory of Convex Geometries. Geometriae Dedicata 19(3), 247–270 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Info. 20, 345–369 (1983)

    MATH  MathSciNet  Google Scholar 

  5. Fredkin, E.: Trie Memory. Comm. ACM 3(6), 490–499 (1960)

    Article  Google Scholar 

  6. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)

    Google Scholar 

  7. Korte, B., Lovász, L., Schrader, R.: Greedoids. Springer, Berlin (1991)

    Book  MATH  Google Scholar 

  8. Kumar, V.: Concurrent operations on extendible hashing and its performance. Comm. ACM 33(6), 681–694 (1990)

    Article  Google Scholar 

  9. Manning, C.D., Raghavan, P., Schültz, H.: Introduction to Information Retrieval. Cambridge Univ. Press (2008)

    Google Scholar 

  10. Mikesell, D.R., Emanuel, W.R.: Interfacing an Object-Oriented Database System to a Global Primary Productivity Simulation. In: 12th Intern’l. Scientific and Statistical Database Conf., Berlin, Germany (July 2000)

    Google Scholar 

  11. Orlandic, R.: Design, Analysis and Applications of Compact 0-Complete Trees. Ph.D. Dissertation, Univ. of Virginia (May 1989)

    Google Scholar 

  12. Orlandic, R., Mahmoud, H.: Storage Overhead of O-trees, B-trees, and Prefix B-trees: A Comparative Analysis. Int. J. of Foundations of Computer Science 7(3), 209–226 (1996)

    Article  MATH  Google Scholar 

  13. Orlandic, R., Pfaltz, J.L.: Compact 0-Complete Trees. In: Proc. 14th VLDB Conf., Long Beach, CA, pp. 372–381 (August 1988)

    Google Scholar 

  14. Pfaltz, J.L.: Mathematical Continuity in Dynamic Social Networks. In: Datta, A., Shulman, S., Zheng, B., Lin, S.-D., Sun, A., Lim, E.-P. (eds.) SocInfo 2011. LNCS, vol. 6984, pp. 36–50. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Pfaltz, J.L.: Finding the Mule in the Network. In: Alhajj, R., Werner, B. (eds.) Intern. Conf. on Advances in Social Network Analysis and Mining, ASONAM 2012, Istanbul, Turkey, pp. 667–672 (August 2012)

    Google Scholar 

  16. Pfaltz, J.L.: The Irreducible Spine(s) of Discrete Networks. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013, Part II. LNCS, vol. 8181, pp. 104–117. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Pfaltz, J.L., French, J.C.: Scientific Database Management with ADAMS. Data Engineering 16(1), 14–18 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FairCom Corporation, Columbia, MO, USA

    Ratko Orlandic

  2. Dept. of Computer Science, University of Virginia, USA

    John Pfaltz

  3. Dept. Microbiology, Immunology and Parasitology, LSU Health Sciences Center, New Orleans, LA, USA

    Christopher Taylor

Authors
  1. Ratko Orlandic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Pfaltz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christopher Taylor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Applied Informatics (CAI), College of Engineering and Science, Victoria University, Ballarat Road, 8001, Footscray, VIC, Australia

    Hua Wang

  2. Faculty of Engineering, Architecture and Information Technology, School of Information Technology and Electrical Engineering, The University of Queensland, St. Lucia, 4072, Brisbane, QLD, Australia

    Mohamed A. Sharaf

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Orlandic, R., Pfaltz, J., Taylor, C. (2014). A Functional Database Representation of Large Sets of Objects. In: Wang, H., Sharaf, M.A. (eds) Databases Theory and Applications. ADC 2014. Lecture Notes in Computer Science, vol 8506. Springer, Cham. https://doi.org/10.1007/978-3-319-08608-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08608-8_17

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08607-1

  • Online ISBN: 978-3-319-08608-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation