Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Categorizing Case-Base Maintenance: Dimensions and Directions
EWCBR '98 Proceedings of the 4th European Workshop on Advances in Case-Based Reasoning
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A survey of data provenance in e-science
ACM SIGMOD Record
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Searching Substructures with Superimposed Distance
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Retrieval, reuse, revision and retention in case-based reasoning
The Knowledge Engineering Review
SAGA: a subgraph matching tool for biological graphs
Bioinformatics
myExperiment: social networking for workflow-using e-scientists
Proceedings of the 2nd workshop on Workflows in support of large-scale science
Dex: high-performance exploration on large graphs for information retrieval
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Building CBR systems with jcolibri
Science of Computer Programming
Survey of graph database models
ACM Computing Surveys (CSUR)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Towards Case-Based Support for e-Science Workflow Generation by Mining Provenance
ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
Rapid Prototyping of CBR Applications with the Open Source Tool myCBR
ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
Periscope/GQ: a graph querying toolkit
Proceedings of the VLDB Endowment
Software Design for Empowering Scientists
IEEE Software
G-hash: towards fast kernel-based similarity search in large graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Four Heads Are Better than One: Combining Suggestions for Case Adaptation
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
SQL databases v. NoSQL databases
Communications of the ACM
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
HyperGraphDB: a generalized graph database
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
iGraph in action: performance analysis of disk-based graph indexing techniques
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
a.SCatch: semantic structure for architectural floor plan retrieval
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Retrieval of semantic workflows with knowledge intensive similarity measures
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Case-based adaptation of workflows
Information Systems
Hi-index | 0.00 |
Case-Based reasoning (CBR) applications are increasingly used for problems involving structured data, especially in process-oriented domains. Available CBR frameworks rely primarily on flat case representations, leaving developers of process-oriented CBR systems without general-purpose tools aimed at their needs. This paper discusses needs to support structure-based retrieval for CBR and how they have been addressed in the development of the Structure Access Interface (SAI), a toolkit for representation and retrieval of structured cases which is now available for general use. Integrating SAI into a CBR project eliminates the need for developing a storage scheme for graph data structures and facilitates the development of retrieval algorithms by (1) providing useful code for common retrieval tasks and (2) delineating the tasks which may require domain-specific implementations. SAI maintains flexibility through its customizability yet carries solutions for many common tasks for CBR developers, as well as illuminating some general principles for addressing common representation and retrieval needs for process-oriented CBR tasks and the relationship between CBR needs for structured retrieval and needs and methods in graph oriented database research. The paper closes with an evaluation of SAI's scalability and demonstration of the value of enabling developers to select retrieval methods suited to their tasks. It closes with a discussion of SAI's relationship to the growing body of work on graph databases.