{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:56Z","timestamp":1725663296019},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:06:46Z","timestamp":1330186006000},"page":"218-229","source":"Crossref","is-referenced-by-count":0,"title":["On the performance of orthogonal range queries in multiattribute and doubly chained trees"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Gardy","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Flajolet","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Puech","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0306-4379(75)90016-2","volume":"1","author":"A. F. Cardenas","year":"1975","unstructured":"A.F. Cardenas, J.P. Sagamang: Modeling and analysis of data base organization: the doubly chained tree structure. Information Systems, Vol. 1, 57\u201367 (1975).","journal-title":"Information Systems"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/comjnl\/20.1.15","volume":"20","author":"A. F. Cardenas","year":"1977","unstructured":"A.F. Cardenas, J.P. Sagamang: Doubly chained tree data base organization-analysis and design strategies. The Computer Journal, Vol. 20, No 1, 15\u201326 (1977).","journal-title":"The Computer Journal"},{"issue":"2","key":"19_CR3","first-page":"371","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet, C. Puech: Partial match retrieval of multidimensional data. Journal of the A.C.M., Vol. 33, No 2, 371\u2013407 (April 1986).","journal-title":"Journal of the A.C.M."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"D. Gardy, P. Flajolet, C. Puech: Average cost of orthogonal range queries in multiattribute trees. To appear in Information Systems, Vol. 14, No. 4, 1989.","DOI":"10.1016\/0306-4379(89)90053-7"},{"issue":"1","key":"19_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/320128.320135","volume":"6","author":"V. Gopalakrishna","year":"1980","unstructured":"V. Gopalakrishna, C.E. Veni Madhavan: Performance evaluation of attribute-based tree organization. A.C.M. Transactions On Database Systems, Vol. 6, No 1, 69\u201387 (March 1980).","journal-title":"A.C.M. Transactions On Database Systems"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0065-2458(08)60257-0","volume":"27","author":"S. S. Iyengar","year":"1988","unstructured":"S. Sitharama Iyengar, N.S.V. Rao, R.L. Kashyap, V.K. Vaishnavi: Multidimensional Data Structures: Review and Outlook. Advances in Computers, Academic Press, Vol. 27, 1988, 69\u2013119.","journal-title":"Advances in Computers, Academic Press"},{"issue":"6","key":"19_CR7","first-page":"451","volume":"SE-3","author":"R. L. Kashyap","year":"1977","unstructured":"R.L. Kashyap, S.K.C. Subas, S.B. Yao: Analysis of the multiple-attribute-tree database organization. I.E.E.E. Transactions on Software Engeneering, Vol. SE-3, No 6, 451\u2013467 (Nov. 1977).","journal-title":"I.E.E.E. Transactions on Software Engeneering"},{"key":"19_CR8","unstructured":"C. Puech: M\u00e9thodes d'analyse de structures de donn\u00e9es dynamiques. Th\u00e8se d'Etat, Orsay (France), Avril 1984."},{"issue":"3","key":"19_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(88)90069-2","volume":"62","author":"N. S. V. V. Rao","year":"1988","unstructured":"N.S.V. Rao, S.S. Iyengar, R.L. Kashyap: An average-case analysis of MAT and inverted file. Theoretical Computer Science, Vol. 62, No. 3, Dec. 1988, 251\u2013266.","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"P. Svensson: On search performance for conjunctive queries in compressed, fully transposed ordered files. Proc. Fifth International Conference on Very Large Data Bases, Rio de Janeiro, Brazil, 155\u2013163 (3\u20135 Oct. 1979).","DOI":"10.1109\/VLDB.1979.718131"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:53Z","timestamp":1605630113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}