Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14912
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | HELLINGS, Jelle | - |
dc.contributor.author | KUIJPERS, Bart | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | ZHANG, Xiaowang | - |
dc.date.accessioned | 2013-04-03T11:57:05Z | - |
dc.date.available | 2013-04-03T11:57:05Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Tan, Wang-Chiew; Guerrini, Giovanna; Catania, Barbara; Gounaris, Anastasios (Ed.). Proceedings of the 16th International Conference on Database Theory, p. 117-128 | - |
dc.identifier.isbn | 978-1-4503-1598-2 | - |
dc.identifier.uri | http://hdl.handle.net/1942/14912 | - |
dc.description.abstract | Motivated by the current interest in languages for expressing path queries to graph databases, this paper proposes to investigate Walk Logic (WL): the extension of first-order logic on finite graphs with the possibility to explicitly quantify over walks. WL can serve as a unifying framework for path query languages. To support this claim, WL is compared in expressive power with various established query languages for graphs, such as first-order logic extended with reachability; the monadic second-order logic of graphs; hybrid computation tree logic; and regular path queries. WL also serves as a framework to investigate the following natural questions: Is quantifying over walks more powerful than quantifying over paths (walks without repeating nodes) only? Is quantifying over infinite walks more powerful than quantifying over finite walks only? WL model checking is decidable, but determining the precise complexity remains an open problem. | - |
dc.language.iso | en | - |
dc.publisher | ACM | - |
dc.relation.ispartofseries | International Conference on Database Theory | - |
dc.rights | ACM | - |
dc.subject.other | Logic; Databases | - |
dc.title | Walk logic as a framework for path query languages on graph databases | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Tan, Wang-Chiew | - |
local.bibliographicCitation.authors | Guerrini, Giovanna | - |
local.bibliographicCitation.authors | Catania, Barbara | - |
local.bibliographicCitation.authors | Gounaris, Anastasios | - |
local.bibliographicCitation.conferencedate | March 18-22, 2013 | - |
local.bibliographicCitation.conferencename | 16th International Conference on Database Theory (ICDT'13) | - |
local.bibliographicCitation.conferenceplace | Genova, Italy | - |
dc.identifier.epage | 128 | - |
dc.identifier.spage | 117 | - |
local.bibliographicCitation.jcat | C1 | - |
local.publisher.place | New York | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 16 | - |
local.relation.fp7 | 245410 | - |
dc.identifier.doi | 10.1145/2448496.2448512 | - |
local.bibliographicCitation.btitle | Proceedings of the 16th International Conference on Database Theory | - |
item.fulltext | With Fulltext | - |
item.fullcitation | HELLINGS, Jelle; KUIJPERS, Bart; VAN DEN BUSSCHE, Jan & ZHANG, Xiaowang (2013) Walk logic as a framework for path query languages on graph databases. In: Tan, Wang-Chiew; Guerrini, Giovanna; Catania, Barbara; Gounaris, Anastasios (Ed.). Proceedings of the 16th International Conference on Database Theory, p. 117-128. | - |
item.contributor | HELLINGS, Jelle | - |
item.contributor | KUIJPERS, Bart | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | ZHANG, Xiaowang | - |
item.accessRights | Open Access | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
icdt2013_paper.pdf | Peer-reviewed author version | 418.07 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
12
checked on Sep 7, 2020
Page view(s)
106
checked on Sep 5, 2022
Download(s)
268
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.