{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:15Z","timestamp":1725456195520},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019435","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:16:42Z","timestamp":1132640202000},"page":"186-204","source":"Crossref","is-referenced-by-count":1,"title":["Fast lattice browsing on sparse representation"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Talamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"R. Agrawal. Alpha: an extension of relational algebra to express a class of recoursive queries. In IEEE 3rd Int. Conf. Data Engineering, 1987.","key":"13_CR1","DOI":"10.1109\/ICDE.1987.7272427"},{"doi-asserted-by":"crossref","unstructured":"R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationship in large data and knowledge bases. In ACM SIGMOD, 1989.","key":"13_CR2","DOI":"10.1145\/67544.66950"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. Ait-Kaci","year":"1989","unstructured":"H. Ait-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Trans. on Prog. Lang. and Syst, 11:115\u2013146, 1989.","journal-title":"ACM Trans. on Prog. Lang. and Syst"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","volume":"19","author":"H. Alt","year":"1984","unstructured":"H. Alt, K. Mehlhorn, and J.J. Munro. Partial match retrieval in implicit data structures. Information Processing Letters, 19:61\u201366, 1984.","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Joachim Biskup and Holger Stiefeling. Evaluation of upper bounds and least nodes as database operations. Technical report, ESPRIT-project 311-Advanced Data and Knowledge Management System, 1992.","key":"13_CR5","DOI":"10.1007\/3-540-57301-1_12"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(88)90018-7","volume":"58","author":"A. Borodin","year":"1988","unstructured":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson. A trade-off between search and update time for the implicit dictionary problem. Theoretical Computer Science, 58:57\u201368, 1988.","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"B. Dushnik and E. Miller. Partially ordered sets. Amer. J. Math., 63:600\u2013610, 1941.","journal-title":"Amer. J. Math."},{"unstructured":"P. G. Franciosa and M. Talamo. Orders, implicit k-sets representation and fast halfplane searching. submitted to ORDAL'94, 1994.","key":"13_CR8"},{"doi-asserted-by":"crossref","unstructured":"G. Gambosi, J. Nesetril, and M. Talamo. On locally presented posets. Theoretical Computer Science, 1990.","key":"13_CR9","DOI":"10.1016\/0304-3975(90)90125-2"},{"doi-asserted-by":"crossref","unstructured":"G. Gambosi, M. Protasi, and M.Talamo. An efficient implicit data structure for relation testing and searching in partially ordered sets. BIT, 1992.","key":"13_CR10","DOI":"10.1007\/BF01990341"},{"doi-asserted-by":"crossref","unstructured":"H. V. Jagadish. Incorporating hierarchy in a realation model of data. In ACM-SIGMOD 1989 Int. Conf. Management of Data, Portland, Oregon, 1989.","key":"13_CR11","DOI":"10.1145\/67544.66934"},{"doi-asserted-by":"crossref","unstructured":"T. Kameda. On the vector representation of the reachability in planar directed acyclic graphs. Information Processing Letters, 3(3), 1975.","key":"13_CR12","DOI":"10.1016\/0020-0190(75)90019-8"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0167-5060(08)70708-8","volume":"6","author":"D. J. Kleitman","year":"1980","unstructured":"D. J. Kleitman and K. J. Winston. The asymptotic number of lattices. Annuals of Discrete Matemathics, 6:243\u2013249, 1980.","journal-title":"Annuals of Discrete Matemathics"},{"key":"13_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, Berlin, New York, 1985."},{"doi-asserted-by":"crossref","unstructured":"F. P. Preparata and R. Tamassia. Fully dynamic point location in a monotone subdivision. SIAM Journal of Computing, 18(4), 1989.","key":"13_CR15","DOI":"10.1137\/0218056"},{"doi-asserted-by":"crossref","unstructured":"I. Rival. Graphical data structures for ordered sets. In I.Rival, editor, Algorithms and Orders. Kluwer Academic Publishers, 1989.","key":"13_CR16","DOI":"10.1007\/978-94-009-2639-4_1"},{"key":"13_CR17","volume-title":"Technical report","author":"R. Tamassia","year":"1990","unstructured":"R. Tamassia and J. G. Tollis. Reachability in planar digraphs. Technical report, Brown University, Providence, Rhode Island, 1990."},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","volume":"22","author":"W. T. Trotter Jr","year":"1977","unstructured":"Jr W. T. Trotter and Jr. J. I. Moore. The dimension of planar posets. Journal of Combinatorial Theory, 22:54\u201357, 1977.","journal-title":"Journal of Combinatorial Theory"},{"doi-asserted-by":"crossref","unstructured":"M. Yannakakis. Graph theoretic methods in database theory. In ACM STOC, 1990.","key":"13_CR19","DOI":"10.1145\/298514.298576"}],"container-title":["Lecture Notes in Computer Science","Orders, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019435.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:42:42Z","timestamp":1607550162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582746"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0019435","relation":{},"subject":[]}}