Abstract
We present an practical method to obtain a compact computer memory representation of orders and to compute pairwise comparisons efficiently. The principle of this method is to represent an order P as a union of interval orders P i for which an optimal representation is already known (i.e. a union representation of P [Wes85]). For a directed acyclic graph G = (X, U) representing an order P = (X, <p), the preprocessing time complexity is not better than the transitive closure computation cost. In the worst case, the size of the representation is the same that the size of the transitive closure. However, experimental tests give better results, and comparison with the compression technique of Agrawal & al. [ABJ89] is at the advantage of our method for dense orders.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Rakesh Agrawal, Alex Borgida, and H.V. Jagadish. Efficient management of transitive relationships in large data bases, including is-a hierarchies. ACM SIGMOD, 1989.
Hassan Aït-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Langages and Systems, 11(1):115–146, January 1989.
P. Baldy. Ensembles ordonnés: algorithmes, structures et applications aux systèmes distribués. PhD thesis, Université Montpellier II, July 1994.
Philippe Baldy and Christophe Fiorio. Estampillage des algorithmes distribués et ensembles ordonnés. Master's thesis, Université Montpellier II, 1991. Mémoire de DEA Informatique.
Philippe Baldy and Michel Morvan. A linear time and space algorithm to recognize interval orders. Discrete Applied Mathematics, (46):173–178, 1993.
Christian Capelle. Représentation des ensembles ordonnés. Master's thesis, Université Montpellier II, June 1993. Mémoire de DEA Informatique.
Yves Caseau. Efficient handling of multiple inheritance hierarchies. In OOPSLA '93, pages 271–287, 1993.
Claire Diehl. Analyse de la relation de causalité dans les exécutions réparties. PhD thesis, Université de Rennes I, 1992.
S. Felsner, M. Habib, and R.Möhring. On the interplay between interval dimension and ordinary dimension. In Oberwohlfach Meeting on Ordered Sets, Germany, 1991.
C.J. Fidge. Timestamps in message-passing systems that preserve the partial ordering, February 1988.
P. C. Fishburn. Intransitive indifference in preference theory: a survey. Oper. Res., (18):207–228, 1970.
Michel Habib, Michel Morvan, and Jean-Xavier Rampon. On the calculation of transitive reduction-closure of orders. Discrete Mathematics, (111):289–303, 1993.
M. Habib and L. Nourine. Tree structure for distributive lattices and its applications. submitted to TCS.
S. Kannan, M. Naor, and S. Rudich. Imlicit representation of graphs. SIAM J. Disc. Math., 5(4):596–603, November 1992.
L. Lamport. Time, clocks, and the ordering of events in distributed systems. Communications of the ACM, 7(21):558–565, July 1978.
F. Mattern. Virtual time and global states of distributed systems. In M. Cosnard and al., editors, Parallel and Distributed Algorithms, pages 215–226. Elsevier / North-Holland, 1989.
R. H. Möhring. Computationally tractable classes of ordered sets. In I. Rival, editor, Algorithms and Orders, pages 105–193. Kluwer Academic Publishers, 1989. volume: 255, series C: Mathematical and Physical Sciences.
Michel Morvan. Algorithmes Linéaires et Invariants d'Ordres. PhD thesis, Université Montpellier II, 1991.
T.-H. Ma and J. Spinrad. Transitive closure for restricted classes of partial orders. Order, (8):175–183, 1991.
T. Madej and D.B. West. The interval inclusion number of a partial ordered set. Discrete Mathematics, (88):259–277, 1991.
Lhouari Nourine. Quelques Propriétés Algorithmiques des Treillis. PhD thesis, Université Montpellier II, 1993.
Douglas B. West. Parameters of partial orders and graphs: packing, covering, and representation. In Ivan Rival, editor, Graphs and Orders, pages 267–350. NATO, D. Reidel publishing company, 1985.
M. Yannakakis. The comlexity of the partial order dimension problem. SIAM J. Alg. Disc. Meth., 3:351–358, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capelle, C. (1994). Representation of an order as union of interval orders. In: Bouchitté, V., Morvan, M. (eds) Orders, Algorithms, and Applications. ORDAL 1994. Lecture Notes in Computer Science, vol 831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019432
Download citation
DOI: https://doi.org/10.1007/BFb0019432
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58274-8
Online ISBN: 978-3-540-48597-1
eBook Packages: Springer Book Archive