{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:35Z","timestamp":1778300975173,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0304-3975(96)00209-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"373-392","source":"Crossref","is-referenced-by-count":7,"title":["A data structure for lattice representation"],"prefix":"10.1016","volume":"175","author":[{"given":"M.","family":"Talamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00209-5_BIB1","series-title":"IEEE 3rd Internat. Conf. Data Eng.","article-title":"Alpha: An extension of relational algebra to express a class of recursive queries","author":"Agrawal","year":"1987"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB2","series-title":"ACM SIGMOD","article-title":"Efficient management of transitive relationship in large data and knowledge bases","author":"Agrawal","year":"1989"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/59287.59293","article-title":"Efficient implementation of lattice operations","volume":"11","author":"Ait-Kaci","year":"1989","journal-title":"ACM Trans. Prog. Lang. Systems"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","article-title":"Partial match retrieval in implicit data structures","volume":"19","author":"Alt","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/S0002-9947-1948-0027263-2","article-title":"Representation of lattices by sets","volume":"64","author":"Birkhoff","year":"1948","journal-title":"Trans. AMS"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB6","article-title":"Evaluation of upper bounds and least nodes as database operations","author":"Biskup","year":"1992","journal-title":"Technical Report, ESPRIT-project 311 \u2014 Advanced Data and Knowledge Management System"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(88)90018-7","article-title":"A trade-off between search and update time for the implicit dictionary problem","volume":"58","author":"Borodin","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB8","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","article-title":"Partially ordered sets","volume":"63","author":"Dushnik","year":"1941","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB9","series-title":"Orders, Algorithms, and Applications, Internat. Workshop ORDAL '94","first-page":"117","article-title":"Orders, implicit k-sets representation and fast halfplane searching","volume":"Vol. 831","author":"Franciosa","year":"1994"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB10","first-page":"2","article-title":"An efficient implicit data structure for relation testing and searching in partially ordered sets","volume":"Vol. 32","author":"Gambosi","year":"1992","journal-title":"BIT"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB11","series-title":"ACM-SIGMOD 1989 Internat. Conf. Management of Data","article-title":"Incorporating hierarchy in a realation model of data","author":"Jagadish","year":"1989"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(75)90019-8","article-title":"On the vector representation of the reachability in planar directed acyclic graphs","volume":"3","author":"Kameda","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0167-5060(08)70708-8","article-title":"The asymptotic number of lattices","volume":"6","author":"Kleitman","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02483096","article-title":"The representation of posets and lattices by sets","volume":"11","author":"Markowsky","year":"1980","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB15","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB16","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/0218056","article-title":"Fully dynamic point location in a monotone subdivision","volume":"18","author":"Preparata","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB17","series-title":"Algorithms and Orders","article-title":"Graphical data structures for ordered sets","author":"Rival","year":"1989"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB18","unstructured":"M. Talamo and P. Vocca, A time optimal O(n\u221an)-space data structure for lattices representation, SIAM J. Comput., to appear."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB19","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90164-O","article-title":"Reachability in planar digraphs with one source and one sink","volume":"119","author":"Tamassia","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00209-5_BIB20","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","article-title":"The dimension of planar posets","volume":"22","author":"Trotter","year":"1977","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(96)00209-5_BIB21","series-title":"ACM STOC","article-title":"Graph theoretic methods in database theory","author":"Yannakakis","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:57:26Z","timestamp":1555405046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0304397596002095"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00209-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}