This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Path Signatures: A Way to Speed Up Recursion in Relational Databases
June 1996 (vol. 8 no. 3)
pp. 446-454

Abstract—Composite objects often involve recursive relationships, so called bills-of-materials, which are cumbersome to handle in relational database systems. The relationships constitute a directed graph, where the successors of a node represent its components, recursively. Instead of the whole transitive closure (all ancestor-descendant pairs), the task is here to retrieve the descendants of any given node. A simple relational solution is suggested, which packs information of the ancestor path of each node into a fixed-length code, called the signature. The code is nonunique, and its purpose is to define a relatively small superset of the descendants, as well as establish a basis for clustering. It supports effective retrieval of the descendants, in terms of both disk accesses and DBMS calls. The method performs best for tree-structured graphs, where the processing time typically decreases by a factor of more than 10, compared to a simple loop of joins. Also general directed graphs, both acyclic and cyclic, can be processed more effectively. The method is implemented on top of a relational system, but advantages can be gained on other platforms, too.

[1] R. Agrawal and H.V. Jagadish, "Direct Algorithms for Computing the Transitive Closure of Database Relations," Proc. 13th VDLB Conf.,Brighton, England, pp. 255-266, 1987.
[2] R. Agrawal and H. Jagadish, “Materialization and Incremental Update of Path Information,” Proc. IEEE Fifth Int'l Conf. Data Eng., pp. 374-383, 1989.
[3] F. Bancilhon and R. Ramakrishnan,“An amateur’s introduction to recursive query processing strategies,” Proc. 1986 ACM-SIGMOD Int’l Conf. Management Data, pp. 16-52,Washington, DC, May 1986.
[4] J. Banerjee, S. Kim, W. Kim, and J. Garza, "Clustering a DAG for CAD Databases," IEEE Trans. Software Eng., vol. 14, no. 11, pp. 1,684-1,699, Nov. 1988.
[5] M. Carey, E. Shekita, G. Lapis, B. Lindsay, and J. McPherson, "An Incremental Join Attachment for Starburst," Proc. VLDB, pp. 662-673, 1990.
[6] M.J. Carey, D.J. DeWitt, and J.F. Naughton, "The OO7 Benchmark," Computer Sciences Dept., Univ. of Wisconsin-Madison, 1993.
[7] R.G.G. Cattell, Object Data Management. Addison-Wesley, 1991.
[8] R.G.G. Cattell and J. Skeen, "Object Operations Benchmark," ACM Trans. Database Systems, vol. 17, no. 1, pp. 1-31, 1992.
[9] P. Ciaccia, D. Maio, and P. Tiberio, "A Method for Hierarchy Processing in Relational Systems," Information Systems, vol. 14, no. 2, pp. 93-105, 1989.
[10] P. Dadam et al., "A DBMS Prototype to Support Extended NF2Relations: An Integrated View on Flat Tables and Hierarchies," Proc. ACM SIGMOD Conf.,Washington D.C., pp. 356-367, 1986.
[11] C. Faloutsos, “Signature Based Text Retrieval Methods: A Survery,” IEEE Data Eng. Bull., vol. 13, no. 1, pp. 25-32, Mar. 1990.
[12] R.L. Haskin and R.A. Lorie, "On Extending the Functions of a Relational Database System," Proc. ACM SIGMOD Conf.,Orlando, Fla., pp. 207-212, 1982.
[13] Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms Based on Graph Traversal," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[14] H. Jagadish, “A Compression Technique to Materialize Transitive Closure,” ACM Trans. Database Systems, vol. 15, no. 4, pp. 558-598, Dec. 1990.
[15] T. Keller, G. Graefe, and D. Maier, "Efficient Assembly of Complex Objects," Proc. ACM SIGMOD Conf.,Denver, Colo., pp. 148-157, 1991.
[16] W. Kim, "Object-Oriented Database Systems: Promises, Reality, and Future," Proc. 19th VLDB Conf.,Dublin, Ireland, pp. 676-687, 1993.
[17] B. Lindsay, J. McPherson, and H. Pirahesh, "A Data Management Extension Architecture," Proc. ACM SIGMOD Conf., pp. 220-226, 1987.
[18] H. Lu, "New Strategies for Computing the Transitive Closure of a Relation," Proc. 13th VLDB Conf.,Brighton, England, pp. 267-274, 1987.
[19] D. Maier, "Making Database Systems Fast Enough for CAD Applications," Object-Oriented Concepts, Databases, and Applications, W. Kim and F.H. Lochovsky, eds., pp. 573-582, ACM Press, 1989.
[20] L. Shapiro, "Join Processing in Database Systems with Large Main Memories," ACM Trans. Database Systems, vol. 11, no. 3, Sept. 1986.
[21] M. Stonebraker,L. Row, and M. Hirohama,"The implementation of POSTGRES," IEEE Trans. Knowledge and Data Engineering, vol. 2, no. 7, pp. 125-142, Mar. 1990.
[22] P. Valduriez and H. Boral, "Evaluation of Recursive Queries Using Join Indices," Proc. First Int'l Workshop on Expert Database Systems,Charleston, S.C., pp. 197-208, 1986.
[23] P. Valduriez,S. Khoshafian,, and G. Copeland,“Implementation techniques of complex objects,” Proc. 12th Int’l Conf. Very Large Databases, pp. 101-110, Aug. 1986.

Index Terms:
Bill-of-materials, clustering, composite objects, path encoding, recursive relations, signatures, transitive closure.
Citation:
Jukka Teuhola, "Path Signatures: A Way to Speed Up Recursion in Relational Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 3, pp. 446-454, June 1996, doi:10.1109/69.506711
Usage of this product signifies your acceptance of the Terms of Use.