Sciweavers

294 search results - page 19 / 59
» Answering Regular Path Queries Using Views
Sort
View
COCOON
1999
Springer
14 years 22 days ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
TKDE
2010
152views more  TKDE 2010»
13 years 6 months ago
Maintaining Recursive Views of Regions and Connectivity in Networks
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
Mengmeng Liu, Nicholas E. Taylor, Wenchao Zhou, Za...
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
ICLP
2005
Springer
14 years 2 months ago
Abduction of Linear Arithmetic Constraints
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
Michael J. Maher
MFCS
2009
Springer
14 years 3 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
P. Madhusudan, Mahesh Viswanathan