A data structure for lattice representation

Theoretical Computer Science

Volumn 175, Issue 2, 1997, Pages 373-392

  Talamo, M ^a   Vocca, P ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

LATTICE REPRESENTATION;

DATA STRUCTURES;

EID: 0031118370     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00209-5     Document Type: Article

References (21)

1. R. Agrawal, Alpha: An extension of relational algebra to express a class of recursive queries, in: IEEE 3rd Internat. Conf. Data Eng. (1987).
2. R. Agrawal, A. Borgida and H.V. Jagadish, Efficient management of transitive relationship in large data and knowledge bases, in: ACM SIGMOD (1989).
3. H. Ait-Kaci, R. Boyer, P. Lincoln and R. Nasr, Efficient implementation of lattice operations, ACM Trans. Prog. Lang. Systems 11 (1989) 115-146.
4. H. Alt, K. Mehlhorn and J.J. Munro, Partial match retrieval in implicit data structures, Inform. Process. Lett. 19 (1984) 61-66.
5. G. Birkhoff and O. Frink, Representation of lattices by sets, Trans. AMS 64 (1948) 299-316.
6. J. Biskup and H. Stiefeling, Evaluation of upper bounds and least nodes as database operations, Technical Report, ESPRIT-project 311 - Advanced Data and Knowledge Management System, 1992.
7. 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, Theoret. Comput. Sci. 58 (1988) 57-68.
8. B. Dushnik and E. Miller, Partially ordered sets, Amer. J. Math. 63 (1941) 600-610.
9. P.G. Franciosa and M. Talamo, Orders, implicit k-sets representation and fast halfplane searching, in: V. Bouchitté and M. Morvan, eds., Orders, Algorithms, and Applications, Internat. Workshop ORDAL '94, Lecture Notes in Computer Science, Vol. 831 (Springer, Berlin, 1994) 117-127.
10. G. Gambosi, M. Protasi and M. Talamo, An efficient implicit data structure for relation testing and searching in partially ordered sets, BIT, Vol. 32 (1992) 2-16.
11. H.V. Jagadish, Incorporating hierarchy in a realation model of data, in: ACM-SIGMOD 1989 Internat. Conf. Management of Data, Portland, Oregon (1989).
12. T. Kameda, On the vector representation of the reachability in planar directed acyclic graphs, Inform. Process. Lett. 3 (1975) 75-77.
13. D.J. Kleitman and K.J. Winston, The asymptotic number of lattices, Ann. Discrete Math. 6 (1980) 243-249.
14. G. Markowsky, The representation of posets and lattices by sets, Algebra Universalis 11 (1980) 173-192.
15. F.P. Preparata and M.I. Shamos, Computational Geometry (Springer, Berlin, 1985).
16. F.P. Preparata and R. Tamassia, Fully dynamic point location in a monotone subdivision, SIAM J. Comput. 18 (1989) 811-830.
17. I. Rival, Graphical data structures for ordered sets, in: I. Rival, ed., Algorithms and Orders (Kluwer Academic Publishers, Dordrecht, 1989).
18. M. Talamo and P. Vocca, A time optimal O(n√n)-space data structure for lattices representation, SIAM J. Comput., to appear.
19. R. Tamassia and J.G. Tollis, Reachability in planar digraphs with one source and one sink. Theoret. Comput. Sci. 119 (1993).
20. Jr W.T. Trotter and Jr. J.I. Moore, The dimension of planar posets, J. Combin. Theory 22 (1977) 54-57.
21. M. Yannakakis, Graph theoretic methods in database theory, in: ACM STOC (1990).