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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bonin, J.E., Oxley, J.G., Servatius, B. (eds.): Matroid Theory. Contemporary Mathematics, p. 197. Amer. Math. Soc., Providence (1995)
Dekker, A.: Conceptual Distance in Social Network Analysis. J. of Social Structure 6(3), 1–31 (2006)
Edelman, P.H., Jamison, R.E.: The Theory of Convex Geometries. Geometriae Dedicata 19(3), 247–270 (1985)
Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Info. 20, 345–369 (1983)
Fredkin, E.: Trie Memory. Comm. ACM 3(6), 490–499 (1960)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Korte, B., Lovász, L., Schrader, R.: Greedoids. Springer, Berlin (1991)
Kumar, V.: Concurrent operations on extendible hashing and its performance. Comm. ACM 33(6), 681–694 (1990)
Manning, C.D., Raghavan, P., Schültz, H.: Introduction to Information Retrieval. Cambridge Univ. Press (2008)
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)
Orlandic, R.: Design, Analysis and Applications of Compact 0-Complete Trees. Ph.D. Dissertation, Univ. of Virginia (May 1989)
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)
Orlandic, R., Pfaltz, J.L.: Compact 0-Complete Trees. In: Proc. 14th VLDB Conf., Long Beach, CA, pp. 372–381 (August 1988)
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)
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)
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)
Pfaltz, J.L., French, J.C.: Scientific Database Management with ADAMS. Data Engineering 16(1), 14–18 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)