scholarly journals A trichotomy for regular simple path queries on graphs

2020 ◽  
Vol 108 ◽  
pp. 29-48
Author(s):  
Guillaume Bagan ◽  
Angela Bonifati ◽  
Benoit Groz
Keyword(s):  
Simple Path ◽  
Path Queries

Granite: A distributed engine for scalable path queries over temporal property graphs

2021 ◽  
Vol 151 ◽  
pp. 94-111
Author(s):  
Shriram Ramesh ◽  
Animesh Baranawal ◽  
Yogesh Simmhan
Keyword(s):  
Temporal Property ◽  
Path Queries

Query Processing of RFID Data with Object Trajectory in Manufacture and Logistics

2009 ◽  
Vol 16-19 ◽  
pp. 1043-1047
Author(s):  
Sun Wei ◽  
Li Hua Dong ◽  
Yao Hua Dong
Keyword(s):  
Pervasive Computing ◽  
Radio Frequency Identification ◽  
Object Identification ◽  
Data Set ◽  
Wide Range ◽  
Storage Scheme ◽  
Rfid Data ◽  
Frequency Identification ◽  
Application Data ◽  
Path Queries

In the domain of manufacture and logistics, Radio Frequency Identification (RFID) holds the promise of real-time identifying, locating, tracking and monitoring physical objects without line of sight due to an enhanced efficiency, accuracy, and preciseness of object identification, and can be used for a wide range of pervasive computing applications. To achieve these goals, RFID data has to be collected, filtered, and transformed into semantic application data. However, the amount of RFID data is huge. Therefore, it requires much time to extract valuable information from RFID data for object tracing. This paper specifically explores options for modeling and utilizing RFID data set by XML-encoding for tracking queries and path oriented queries. We then propose a method which translates the queries to SQL queries. Based on the XML-encoding scheme, we devise a storage scheme to process tracking queries and path oriented queries efficiently. Finally, we realize the method by programming in a software system for manufacture and logistics laboratory. The system shows that our approach can process the tracing or path queries efficiently.

SONNET: subscription using path queries over structured overlay networks

2007 ◽  
Vol 1 (2) ◽  
pp. 213-225
Author(s):  
Weining Qian ◽  
Linhao Xu ◽  
Aoying Zhou ◽  
Minqi Zhou
Keyword(s):  
Overlay Networks ◽  
Structured Overlay ◽  
Path Queries ◽  
Structured Overlay Networks

FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS

2002 ◽  
Vol 12 (03) ◽  
pp. 249-261 ◽  
Author(s):  
XUEHOU TAN
Keyword(s):  
Hierarchical Structure ◽  
Shortest Path ◽  
Line Segment ◽  
Euclidean Distance ◽  
Geodesic Distance ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Search Trees ◽  
Bridge Problem ◽  
Path Queries

Let π(a,b) denote the shortest path between two points a, b inside a simple polygon P, which totally lies in P. The geodesic distance between a and b in P is defined as the length of π(a,b), denoted by gd(a,b), in contrast with the Euclidean distance between a and b in the plane, denoted by d(a,b). Given two disjoint polygons P and Q in the plane, the bridge problem asks for a line segment (optimal bridge) that connects a point p on the boundary of P and a point q on the boundary of Q such that the sum of three distances gd(p′,p), d(p,q) and gd(q,q′), with any p′ ∈ P and any q′ ∈ Q, is minimized. We present an O(n log 3 n) time algorithm for finding an optimal bridge between two simple polygons. This significantly improves upon the previous O(n2) time bound. Our result is obtained by making substantial use of a hierarchical structure that consists of segment trees, range trees and persistent search trees, and a structure that supports dynamic ray shooting and shortest path queries as well.

Sign in / Sign up

Export Citation Format

Share Document