{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:02Z","timestamp":1725663362650},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:31:53Z","timestamp":1330183913000},"page":"180-189","source":"Crossref","is-referenced-by-count":1,"title":["(Time \u00d7 space)-efficient implementations of hlerarchical conceptual models"],"prefix":"10.1007","author":[{"given":"Nicola","family":"Santoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"11_CR1","unstructured":"J.R. Abrial, \"Data semantics\", in Data Base Management Systems, North Holland, 1974."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"R.P. Brent, \"The parallel evaluation of general arithmetic expressions\", JACM 21 (1974).","DOI":"10.1145\/321812.321815"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"G. Bracchi, A. Fedeli, P. Paolini, \"A relational data base management information system\", Proc. 27th ACM Nat. Conf., 1972.","DOI":"10.1145\/800194.805904"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"C.C. Gotlieb, A.L. Furtado, \"Data schemata based on directed graphs\", Int. J. Comp. Inf. Sci. 8 (1979).","DOI":"10.1007\/BF00995427"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"R. Munz, \"The WELL System: A multiuser database system based on binary relationships and graph pattern-matching\", Information Systems 3 (1978).","DOI":"10.1016\/0306-4379(78)90022-4"},{"key":"11_CR6","unstructured":"N. Santoro, \"Efficient abstract implementations for relational data structures\", Ph.D. Thesis, Computer Science Department, University of Waterloo, 1979."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"M.E. Senko, \"DIAM II: The binary infological level\", Proc. Conf. on Data Abstraction, Definition and Management, 1976.","DOI":"10.1145\/800237.807131"},{"key":"11_CR8","unstructured":"N. Santoro, F.W. Tompa, \"A formalism for describing conceptual models and their abstract implementations\", preliminary draft, School of Computer Science, Carleton University, 1988."},{"key":"11_CR9","unstructured":"F.W. Tompa, \"Choosing an efficient interal schema\", in Systems for Large Data Bases, North Holland, 1976."},{"key":"11_CR10","unstructured":"F.W. Tompa, \"Data structure design\", in Data Structures for Computer Graphics and Pattern Recognition, Academic Press, 1979."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"T. Tsuji, J. Toyoda, K. Tanaka, \"Relational data graphs and some properties of them\", J. Comp. Syst. Sci. 15 (1977).","DOI":"10.1016\/S0022-0000(77)80025-1"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:46Z","timestamp":1605629926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}