Abstract
Metric trees (m-trees) are used to organize and execute fast queries on large databases. In classical schemes based on m-trees, routing information kept in an m-tree node includes a representative or a prototype to describe the sub-cluster. Several research has been done to apply m-trees to databases of attributed graphs. In these works routing elements are selected graphs of the sub-clusters. In the current paper, we propose to use Graph Metric Trees to improve k-nn queries. We present two types of Graph Metric Trees. The first uses a representative (Set Median Graph) as routing information; the second uses a graph prototype. Experimental validation shows that it is possible to improve k-nn queries using m-trees when noise between graphs of the same class is of reasonable level.
This research is supported by Consolider Ingenio 2010: project CSD2007-00018 & by the CICYT project DPI 2010-17112.
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
Smith, J.R., Samet, H.: VisualSEEk: A Fully Automated Content-Based Image Query System. In: Proc. ACM Multimedia, pp. 87–98 (1996)
Gudivada, V.N., Raghavan, V.V.: Special issue on Content Based Image Retrieval Systems. Computer 28(9) (1995)
Berretti, S., Del Bimbo, A., Vicario, E.: Efficient Matching and Indexing of Graph Models in Content-Based Retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10), 1089–1105 (2001)
Zhao, J.L., Cheng, H.K.: Graph Indexing for Spatial Data Traversal in Road Map Databases. Computers & Operations Research 28, 223–241 (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(4), 377–388 (1996)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7), 950–959 (2009)
Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 39–52 (2002)
Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: ACM SIGMOD International Conference on Management of Data, pp. 335–346 (2004)
Lee, S.Y., Hsu, F.: Spatial Reasoning and Similarity Retrieval of Images using 2D C-Strings Knowledge Representation. Pattern Recognition 25(3), 305–318 (1992)
He, H., Singh, A.K.: Closure-Tree: An Index Structure for Graph Queries. In: Proc. International Conference on Data Engineering, p. 38 (2006)
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: Proc. 23rd VLDB Conference, pp. 426–435 (1997)
Wong, A.K.C., et al.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Trans. on Patt. Anal. & Machine Intelligence 7, 599–609 (1985)
Sanfeliu, A., King-Sun, F.: A Distance measure between attributed relational graphs for pattern recognition. IEEE Trans. on Systems, Man, and Cybernetics 13(3), 353–362 (1983)
Solé-Ribalta, A., Serratosa, F.: Graduated Assignment Algorithm for Finding the Common Labelling of a set of Graphs. In: Proceedings of Syn. and Struc. Patt. Recog., pp. 180–190 (2010)
Ferrer, M., Valveny, E., Serratosa, F.: Median graphs: A genetic approach based on new theoretical properties. Pattern Recognition 42(9), 2003–2012 (2009)
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning, 2nd edn. Springer, New York (2009) ISBN 0-387-84857-6
Maltoni, D., Maio, D., Jain, A.K., Prabhakar, S.: Handbook of Fingerprint Recognition. Springer, Heidelberg (2005) ISBN-13: 978-0387954318
Solé, A., Serratosa, F., Vidiella, E.: Graph Indexing and Retrieval based on Median Graphs. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Kittler, J. (eds.) MCPR 2010. LNCS, vol. 6256, pp. 311–321. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serratosa, F., Solé-Ribalta, A., Cortés, X. (2011). K-nn Queries in Graph Databases Using M-Trees. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds) Computer Analysis of Images and Patterns. CAIP 2011. Lecture Notes in Computer Science, vol 6854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23672-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-23672-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23671-6
Online ISBN: 978-3-642-23672-3
eBook Packages: Computer ScienceComputer Science (R0)