Sciweavers

98 search results - page 2 / 20
» Finding Regular Simple Paths in Graph Databases
Sort
View
EDBTW
2006
Springer
13 years 9 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
COLING
2010
13 years 9 days ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 5 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
AINA
2007
IEEE
13 years 11 months ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
ICNP
2005
IEEE
13 years 11 months ago
Simple Robotic Routing in Ad Hoc Networks
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
Daejoong Kim, Nicholas F. Maxemchuk