{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:44Z","timestamp":1725796844295},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319086071"},{"type":"electronic","value":"9783319086088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08608-8_17","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T01:30:34Z","timestamp":1404437434000},"page":"189-197","source":"Crossref","is-referenced-by-count":2,"title":["A Functional Database Representation of Large Sets of Objects"],"prefix":"10.1007","author":[{"given":"Ratko","family":"Orlandic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Pfaltz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"197","volume-title":"Matroid Theory. Contemporary Mathematics","year":"1995","unstructured":"Bonin, J.E., Oxley, J.G., Servatius, B. (eds.): Matroid Theory. Contemporary Mathematics, p. 197. Amer. Math. Soc., Providence (1995)"},{"issue":"3","key":"17_CR2","first-page":"1","volume":"6","author":"A. Dekker","year":"2006","unstructured":"Dekker, A.: Conceptual Distance in Social Network Analysis. J. of Social Structure\u00a06(3), 1\u201331 (2006)","journal-title":"J. of Social Structure"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00149365","volume":"19","author":"P.H. Edelman","year":"1985","unstructured":"Edelman, P.H., Jamison, R.E.: The Theory of Convex Geometries. Geometriae Dedicata\u00a019(3), 247\u2013270 (1985)","journal-title":"Geometriae Dedicata"},{"key":"17_CR4","first-page":"345","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Info.\u00a020, 345\u2013369 (1983)","journal-title":"Acta Info."},{"issue":"6","key":"17_CR5","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie Memory. Comm. ACM\u00a03(6), 490\u2013499 (1960)","journal-title":"Comm. ACM"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58191-5","volume-title":"Greedoids","author":"B. Korte","year":"1991","unstructured":"Korte, B., Lov\u00e1sz, L., Schrader, R.: Greedoids. Springer, Berlin (1991)"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1145\/78973.78979","volume":"33","author":"V. Kumar","year":"1990","unstructured":"Kumar, V.: Concurrent operations on extendible hashing and its performance. Comm. ACM\u00a033(6), 681\u2013694 (1990)","journal-title":"Comm. ACM"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fcltz, H.: Introduction to Information Retrieval. Cambridge Univ. Press (2008)","DOI":"10.1017\/CBO9780511809071"},{"key":"17_CR10","unstructured":"Mikesell, D.R., Emanuel, W.R.: Interfacing an Object-Oriented Database System to a Global Primary Productivity Simulation. In: 12th Intern\u2019l. Scientific and Statistical Database Conf., Berlin, Germany (July 2000)"},{"key":"17_CR11","unstructured":"Orlandic, R.: Design, Analysis and Applications of Compact 0-Complete Trees. Ph.D. Dissertation, Univ. of Virginia (May 1989)"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/S0129054196000166","volume":"7","author":"R. Orlandic","year":"1996","unstructured":"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\u00a07(3), 209\u2013226 (1996)","journal-title":"Int. J. of Foundations of Computer Science"},{"key":"17_CR13","unstructured":"Orlandic, R., Pfaltz, J.L.: Compact 0-Complete Trees. In: Proc. 14th VLDB Conf., Long Beach, CA, pp. 372\u2013381 (August 1988)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-24704-0_9","volume-title":"Social Informatics","author":"J.L. Pfaltz","year":"2011","unstructured":"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.\u00a06984, pp. 36\u201350. Springer, Heidelberg (2011)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013672 (August 2012)","DOI":"10.1109\/ASONAM.2012.111"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-41154-0_8","volume-title":"Web Information Systems Engineering \u2013 WISE 2013","author":"J.L. Pfaltz","year":"2013","unstructured":"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.\u00a08181, pp. 104\u2013117. Springer, Heidelberg (2013)"},{"issue":"1","key":"17_CR17","first-page":"14","volume":"16","author":"J.L. Pfaltz","year":"1993","unstructured":"Pfaltz, J.L., French, J.C.: Scientific Database Management with ADAMS. Data Engineering\u00a016(1), 14\u201318 (1993)","journal-title":"Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08608-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,10]],"date-time":"2022-04-10T09:05:32Z","timestamp":1649581532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08608-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319086071","9783319086088"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08608-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}