Paper Details
- Authors:
- Submitted On:
- 26 March 2020 - 6:50am
- Short Link:
- Type:
- Poster
- Event:
- Presenter's Name:
- Rita Hartel
- Paper Code:
- 124
- Session:
- Posters
Keywords
Subscribe
[1] Stefan Böttcher, Rita Hartel, Sven Peeters,
"Pattern search in grammar-compressed graphs",
IEEE SigPort,
2020. [Online]. Available: http://sigport.org/5033. Accessed: Jun. 02, 2020.
@article{5033-20,
url = {http://sigport.org/5033},
author = {Stefan Böttcher; Rita Hartel; Sven Peeters },
publisher = {IEEE SigPort},
title = {Pattern search in grammar-compressed graphs},
year = {2020} }
url = {http://sigport.org/5033},
author = {Stefan Böttcher; Rita Hartel; Sven Peeters },
publisher = {IEEE SigPort},
title = {Pattern search in grammar-compressed graphs},
year = {2020} }
TY - EJOUR
T1 - Pattern search in grammar-compressed graphs
AU - Stefan Böttcher; Rita Hartel; Sven Peeters
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5033
ER -
T1 - Pattern search in grammar-compressed graphs
AU - Stefan Böttcher; Rita Hartel; Sven Peeters
PY - 2020
PB - IEEE SigPort
UR - http://sigport.org/5033
ER -
Stefan Böttcher, Rita Hartel, Sven Peeters.
(2020).
Pattern search in grammar-compressed graphs.
IEEE SigPort.
http://sigport.org/5033
Stefan Böttcher, Rita Hartel, Sven Peeters,
2020.
Pattern search in grammar-compressed graphs.
Available at:
http://sigport.org/5033.
Stefan Böttcher, Rita Hartel, Sven Peeters.
(2020).
"Pattern search in grammar-compressed graphs."
Web.
1. Stefan Böttcher, Rita Hartel, Sven Peeters.
Pattern search in grammar-compressed graphs [Internet].
IEEE SigPort; 2020.
Available from :
http://sigport.org/5033
Comments
The core idea of this
The core idea of this approach is to compute a grammar based index on a labeled directed graph to support finding the occurrences of sub-graphs isomorphic to a given pattern?
To appreciate the results, it would be interesting to know what kind of data structures were used, i.e., how did you represent your grammar?
The interesting point is how the predecessors on the sets sim[u] and sim[u'] are computed.
Do you use an FM-index, a hash-table, or an inverted index?
Also, for the experiments, how is the "original" graph represented? Did you use a common graph library for sub-graph search?