K-nn Queries in Graph Databases Using M-Trees

被引:0
|
作者
Serratosa, Francesc [1 ]
Sole-Ribalta, Albert [1 ]
Cortes, Xavier [1 ]
机构
[1] Univ Rovira & Virgili, Dept Engn Informat & Matemat, Tarragona, Spain
来源
COMPUTER ANALYSIS OF IMAGES AND PATTERNS: 14TH INTERNATIONAL CONFERENCE, CAIP 2011, PT I | 2011年 / 6854卷
关键词
graph database; m-tree; graph organization; graph prototype; graph indexing; Mean Graph; Median Graph; Set Median Graph; DISTANCE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:202 / 210
页数:9
相关论文
共 50 条
  • [21] k-NN Graph Construction Based on Markov Random Walk
    Cao, Jiangzhong
    Ling, Bingo Wing-Kuen
    Woo, Wai-Lok
    Yang, Zhijing
    2015 IEEE INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING (DSP), 2015, : 343 - 346
  • [22] Trajectory Clustering and k-NN for Robust Privacy Preserving Spatiotemporal Databases
    Dritsas, Elias
    Trigka, Maria
    Gerolymatos, Panagiotis
    Sioutas, Spyros
    ALGORITHMS, 2018, 11 (12):
  • [23] Processing streams of spatial k-NN queries and position updates on manycore GPUs
    Lettich, Francesco
    Orlando, Salvatore
    Silvestri, Claudio
    23RD ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2015), 2015,
  • [24] Real-time processing of k-NN queries over moving objects
    Yu, Ziqiang
    Chen, Yuehui
    Ma, Kun
    SOFT COMPUTING, 2017, 21 (18) : 5181 - 5191
  • [25] Real-time processing of k-NN queries over moving objects
    Ziqiang Yu
    Yuehui Chen
    Kun Ma
    Soft Computing, 2017, 21 : 5181 - 5191
  • [26] Top-k Differential Queries in Graph Databases
    Vasilyeva, Elena
    Thiele, Maik
    Bornhoevd, Christof
    Lehner, Wolfgang
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS (ADBIS 2014), 2014, 8716 : 112 - 125
  • [27] Top-k differential queries in graph databases
    Vasilyeva, Elena
    Thiele, Maik
    Bornhövd, Christof
    Lehner, Wolfgang
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8716 : 112 - 115
  • [28] Answering Top-k Graph Similarity Queries in Graph Databases
    Zhu, Yuanyuan
    Qin, Lu
    Yu, Jeffrey Xu
    Cheng, Hong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2020, 32 (08) : 1459 - 1474
  • [29] Graph-decomposed k-NN searching algorithm on road network
    Wei Jiang
    Bo Ning
    Guanyu Li
    Mei Bai
    Xiao Jia
    Fangliang Wei
    Frontiers of Computer Science, 2024, 18
  • [30] Graph-decomposed k-NN searching algorithm on road network
    Jiang, Wei
    Ning, Bo
    Li, Guanyu
    Bai, Mei
    Jia, Xiao
    Wei, Fangliang
    FRONTIERS OF COMPUTER SCIENCE, 2024, 18 (03)