An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Similarity Searching in Medical Image Databases
IEEE Transactions on Knowledge and Data Engineering
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Storing and querying XML data using denormalized relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Proceedings of the VLDB Endowment
A framework for querying graph-based business process models
Proceedings of the 19th international conference on World wide web
Aggregated search in graph databases: preliminary results
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
RDF as graph-based, diagrammatic logic
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Community mining from multi-relational networks
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Self-organizing maps for learning the edit costs in graph matching
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
In this paper, we investigate the problem of assembling fragments from different graphs to build an answer to a user query. The goal is to be able to provide an answer, by aggregation, when a single graph cannot satisfy all the query constraints. We provide the underlying basic algorithms and a relational framework to support aggregated search in graph databases. Our objective is to provide a flexible framework for the integration of data whose structure is graph-based (e.g., RDF). The idea is that the user has not to specify a join operation between fragments. The way the fragments can be combined is a discovery process and rests on a specific algorithm. We also led some experiments on synthetic datasets to demonstrate the effectiveness of this approach.