Sciweavers

107 search results - page 8 / 22
» Reasoning on regular path queries
Sort
View
LICS
2005
IEEE
14 years 3 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 7 months ago
Road Network Reconstruction for Organizing Paths
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
Daniel Chen, Leonidas J. Guibas, John Hershberger,...
XSYM
2005
Springer
84views Database» more  XSYM 2005»
14 years 3 months ago
Patterns and Types for Querying XML Documents
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
Giuseppe Castagna
DLOG
2007
14 years 4 days ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell
ESWS
2009
Springer
14 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...