Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structures with categorical or geometric distance constraints is not solved yet. In this paper, we develop a method called PIS (...
Saved in:
Main Authors: | YAN, Xifeng, ZHU, Feida, HAN, Jiawei, YU, Philip S. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/939 https://ink.library.smu.edu.sg/context/sis_research/article/1938/viewcontent/SearchingSubstructures_2006.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Feature-based Substructure Similarity Search
by: ZHU, Feida, et al.
Published: (2009) -
Feature-Based Similarity Search in Graph Structures
by: YAN, Xifeng, et al.
Published: (2006) -
Mining Colossal Frequent Patterns by Core Pattern Fusion
by: ZHU, Feida, et al.
Published: (2007) -
Graph OLAP: Towards Online Analytical Processing on Graphs
by: CHEN, CHEN, et al.
Published: (2008) -
Top-K Aggregation Queries over Large Networks
by: Yan, Xifeng, et al.
Published: (2010)