Abstract
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This paper describes one such extension, where database technology is used to implement path queries over a graph view of relational data. Partial-path information is pre-computed and stored in a compressed binary format in an SQL data type. Path querying is implemented using SQL table functions, thus enabling the retrieved path tables to be manipulated within SQL queries in the same way as standard relational tables. The functions are evaluated with particular reference to response time, storage requirements and shortest-path optimality, using road system data representing relationships between over 2.8 million entities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Domingos, P.: Prospects and Challenges for Multi-Relational Data Mining. ACM SIGKDD Explorations Newsletter 5(1), 80–83 (2003)
Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Transactions on Knowledge and Data Engineering 10(3), 409–432 (1998)
Chan, E.P.F., Zhang, N.: Finding Shortest Paths in Large Network Systems. In: Proceedings of the Ninth International Conference on Advances in Geographic Information Systems, pp. 160–166. ACM Press, New York (2001)
Jagadish, H.V.: A Compression Technique to Materialize Transitive Closure. ACM Transactions on Database Systems 15(4), 558–598 (1990)
Ayres, R., King, P.J.H.: Querying Graph Databases Using a Functional Language Extended with Second Order Facilities. In: Morrison, R., Kennedy, J. (eds.) BNCOD 1996. LNCS, vol. 1094, pp. 188–203. Springer, Heidelberg (1996)
Chaudhuri, S.: Data Mining and Database Systems: Where is the Intersection? Bulletin of the IEEE Computer Society Technical Committee on Data Engineering 21(1), 4–8 (1998)
Geist, I., Sattler, K.-U.: Towards Data Mining Operators in Database Systems: Algebra and Implementation. In: Proceedings of the 2nd International Workshop on Databases, Documents and Information Fusion (2002)
Sattler, K.-U., Dunemann, O.: SQL Database Primitives for Decision Tree Classifiers. In: Proceedings of the 10th International Conference on Information and Knowledge Management, pp. 379–386. ACM Press, New York (2001)
Sarawagi, S., Thomas, S., Agrawal, R.: Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications. In: Proceedings of the ACM Special Interest Group on the Management of Data, pp. 343–354. ACM Press, New York (1998)
Melton, J., Eisenberg, A.: SQL Multimedia and Application Packages (SQL/MM). The ACM SIGMOD Record 30(4), 97–102 (2001)
Netz, A., Chaudhuri, S., Fayyad, U., Bernhardt, J.: Integrating Data Mining with SQL Databases: OLE DB for Data Mining. In: Proceedings of the 17th International Conference on Data Engineering, pp. 379–387. IEEE Computer Society Press, Los Alamitos (2001)
Han, J., Chiang, J.Y., Chee, S., Chen, J., Chen, Q., Cheng, S., Gong, W., Kamber, M., Koperski, K., Liu, G., Lu, Y., Stefanovic, N., Winstone, L., Xia, B.B., Zaine, O.R., Zhang, S., Zhu, H.: DBMiner: A System for Data Mining in Relational Databases and Data Warehouses. In: Proceedings of the 1997 Conference of the Centre for Advanced Studies on Collaborative Research, pp. 249–260. IBM Press (1997)
IBM: IBM DB2 Intelligent Miner Scoring. Administration and Programming for DB2. Version 8.1. (2002)
Hutchinson, D., Maheshwari, A., Zeh, N.: An External-Memory Data Structure for Shortest Path Queries. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 51–60. Springer, Heidelberg (1999)
Jung, S., Pramanik, S.: An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps. IEEE Transactions on Knowledge and Data Engineering 14(5), 1029–1046 (2002)
Karypis, G., Kumar, V.: Mutilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing 48(1), 96–129 (1998)
Hamill, R.E.A., Martin, N.J.: The Implementation of Path-Querying Functions in a Relational Database. Technical Report BBKCS-04-01, Birkbeck College (2004)
Huang, Y.-W., Jing, N., Rundensteiner, E.A.: Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types. In: Proceedings of the Third ACM Workshop on Geographic Information Systems, pp. 93–100. ACM Press, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamill, R., Martin, N. (2004). Database Support for Path Query Functions. In: Williams, H., MacKinnon, L. (eds) Key Technologies for Data Management. BNCOD 2004. Lecture Notes in Computer Science, vol 3112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27811-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-27811-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22382-5
Online ISBN: 978-3-540-27811-5
eBook Packages: Springer Book Archive