REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS

Simple item page
dc.contributor.authorTan, Tony
dc.contributor.authorVrgoc, Domagoj
dc.date.accessioned2025-01-23T21:39:57Z
dc.date.available2025-01-23T21:39:57Z
dc.date.issued2014
dc.description.abstractThe standard regular expressions over finite alphabets have been widely accepted as the most basic formalism to query graph databases. However, the major drawback of this approach is that it ignores the presence of data. In this paper we study the so called regular expressions with binding (REWB), that is, regular expressions equipped with variables to store data within a well defined scope. In particular, we study the complexity of the query evaluation of REWB queries over graph databases.
dc.fuente.origenWOS
dc.identifier.doi10.1142/S0129054114400188
dc.identifier.eissn1793-6373
dc.identifier.issn0129-0541
dc.identifier.urihttps://doi.org/10.1142/S0129054114400188
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/101612
dc.identifier.wosidWOS:000350333300004
dc.issue.numero8
dc.language.isoen
dc.pagina.final985
dc.pagina.inicio971
dc.revistaInternational journal of foundations of computer science
dc.rightsacceso restringido
dc.subjectGraph databases
dc.subjectdata words
dc.subjectquery languages
dc.titleREGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS
dc.typeartículo
dc.volumen25
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas