K-nn queries in graph databases using M-trees

Authors:
Francesc Serratosa;Albert Solé-Ribalta;Xavier Cortés
Affiliations:
Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques, Spain;Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques, Spain;Universitat Rovira i Virgili, Departament d'Enginyeria Informàtica i Matemàtiques, Spain
Venue:
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Year:
2011

Citing 15
Cited 2

Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation

Pattern Recognition
VisualSEEk: a fully automated content-based image query system

MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph indexing for spatial data traversal in road map databases

Computers and Operations Research
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Content-Based Image Retrieval Systems

Computer
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Closure-Tree: An Index Structure for Graph Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing
Median graphs: A genetic approach based on new theoretical properties

Pattern Recognition
Graduated assignment algorithm for finding the common labelling of a set of graphs

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Graph indexing and retrieval based on median graphs

MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition

Graph database retrieval based on metric-trees

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Component retrieval based on a database of graphs for Hand-Written Electronic-Scheme Digitalisation

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.