Database Reference
In-Depth Information
Klinger, S., & Austin, J. (2005). Chemical similarity searching using a neural graph matcher. In
Proceed-
ings of the 13th European Symposium on Artificial Neural Networks,
(p. 479-484).
Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In
Proceedings of the IEEE Inter-
national Conference on Data Mining,
(pp. 313-320).
Kuramochi, M., & Karypis, G. (2004). GREW-a scalable frequent subgraph discovery algorithm. In
Proceedings of the IEEE International Conference on Data Mining,
(pp. 439-442).
Lee, J., Oh, J.-H., & Hwang, S. (2005). STRG-index: Spatio-temporal region graph indexing for large
video databases. In
Proceedings of the ACM SIGMOD International Conference on Management of
Data,
(pp. 718-729).
Leser, U. (2005). A query language for biological networks. In
Proceedings of the Fourth European
Conference on Computational Biology/Sixth Meeting of the Spanish Bioinformatics Network,
(p. 39).
Manola, F., & Miller, E. (2004).
RDF primer: World Wide Web consortium proposed recommendation.
Retrieved from http://www.w3.org/TR/rdf-primer/
Prud'hommeaux, E., & Seaborne, A. (2008).
SPARQL query language for RDF.
World Wide Web con-
sortium proposed recommendation. Retrieved from http://www.w3.org/TR/rdf-sparql-query/
Raymond, J. W., Gardiner, E. J., & Willett, P. (2002). RASCAL: Calculation of graph similarity using
maximum common edge subgraphs.
The Computer Journal
,
45
(6), 631-644. doi:10.1093/comjnl/45.6.631
Sakr, S. (2009). GraphREL: A decomposition-based and selectivity-aware relational framework for
processing sub-graph queries. In
Proceedings of the 14th International Conference on Database Systems
for Advanced Applications,
(pp. 123-137).
Sheng, L., Ozsoyoglu, Z. M., & Ozsoyoglu, G. (1999). A graph query language and its query processing.
In
Proceedings of the 15th International Conference on Data Engineering,
(pp. 572-581).
Stocker, M., Seaborne, A., Bernstein, A., Kiefer, C., & Reynolds, D. (2008). SPARQL basic graph pat-
tern optimization using selectivity estimation. In
Proceedings of the 17th International Conference on
World Wide Web,
(pp. 595-604).
Teubner, J., Grust, T., Maneth, S., & Sakr, S. (2008). Dependable cardinality forecasts for XQuery.
[PVLDB].
Proceedings of the VLDB Endowment
,
1
(1), 463-477.
Tian, Y., McEachin, R. C., Santos, C., States, D. J., & Patel, J. M. (2007). SAGA: A subgraph matching
tool for biological graphs.
Bioinformatics (Oxford, England)
,
23
(2), 232-239. doi:10.1093/bioinformat-
ics/btl571
Wang, C., Wang, W., Pei, J., Zhu, Y., & Shi, B. (2004). Scalable mining of large disk-based graph data-
bases. In
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery
and Data Mining,
(pp. 316-325).
Washio, T., & Motoda, H. (2003). State of the art of graph-based data mining.
SIGKDD Explorations
,
5
(1), 59-68. doi:10.1145/959242.959249
