Advertisement

A Functional Database Representation of Large Sets of Objects

  • Ratko Orlandic
  • John Pfaltz
  • Christopher Taylor
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Tree Search Social Network Analysis Closure Operator Large Social Network Index Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bonin, J.E., Oxley, J.G., Servatius, B. (eds.): Matroid Theory. Contemporary Mathematics, p. 197. Amer. Math. Soc., Providence (1995)Google Scholar
  2. 2.
    Dekker, A.: Conceptual Distance in Social Network Analysis. J. of Social Structure 6(3), 1–31 (2006)Google Scholar
  3. 3.
    Edelman, P.H., Jamison, R.E.: The Theory of Convex Geometries. Geometriae Dedicata 19(3), 247–270 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Info. 20, 345–369 (1983)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Fredkin, E.: Trie Memory. Comm. ACM 3(6), 490–499 (1960)CrossRefGoogle Scholar
  6. 6.
    Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)Google Scholar
  7. 7.
    Korte, B., Lovász, L., Schrader, R.: Greedoids. Springer, Berlin (1991)CrossRefzbMATHGoogle Scholar
  8. 8.
    Kumar, V.: Concurrent operations on extendible hashing and its performance. Comm. ACM 33(6), 681–694 (1990)CrossRefGoogle Scholar
  9. 9.
    Manning, C.D., Raghavan, P., Schültz, H.: Introduction to Information Retrieval. Cambridge Univ. Press (2008)Google Scholar
  10. 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. 11.
    Orlandic, R.: Design, Analysis and Applications of Compact 0-Complete Trees. Ph.D. Dissertation, Univ. of Virginia (May 1989)Google Scholar
  12. 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)CrossRefzbMATHGoogle Scholar
  13. 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. 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)CrossRefGoogle Scholar
  15. 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. 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)CrossRefGoogle Scholar
  17. 17.
    Pfaltz, J.L., French, J.C.: Scientific Database Management with ADAMS. Data Engineering 16(1), 14–18 (1993)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Ratko Orlandic
    • 1
  • John Pfaltz
    • 2
  • Christopher Taylor
    • 3
  1. 1.FairCom CorporationColumbiaUSA
  2. 2.Dept. of Computer ScienceUniversity of VirginiaUSA
  3. 3.Dept. Microbiology, Immunology and ParasitologyLSU Health Sciences CenterNew OrleansUSA

Personalised recommendations