Efficient algorithms for generalized subgraph query processing

Author(s):  
Wenqing Lin ◽  
Xiaokui Xiao ◽  
James Cheng ◽  
Sourav S. Bhowmick
Author(s):  
Hyunjoon Kim ◽  
Yunyoung Choi ◽  
Kunsoo Park ◽  
Xuemin Lin ◽  
Seok-Hee Hong ◽  
...  

2009 ◽  
Vol 21 (2) ◽  
pp. 159-191 ◽  
Author(s):  
Shuo Zhang ◽  
Xiaofeng Gao ◽  
Weili Wu ◽  
Jianzhong Li ◽  
Hong Gao

2013 ◽  
Vol 311 ◽  
pp. 147-152
Author(s):  
Chih Ming Chiu ◽  
Shao Shin Hung ◽  
Jyh Jong Tsay ◽  
Kuo Kuang Fan

3D walkthrough (henceforth referred as WT) becomes popular and apparent when the volume of query processing in some 3D scenery (e.g., the walkthrough system and the 3D museum navigation systems) is considered. In this scenario, different people with similar behaviours induce completely different space-time traversal patterns in a recoded traversal sequence. This is because they navigate different paths, and their surrounding backgrounds are different. What are common across such sequences of the same behaviours are the underlying induced walkthrough fields. We want to make use of regions of common sequential traversal patterns for acceleration and compaction purposes. In this paper we propose a new Sequence-based Pattern Similarity (SPS) approach based on a behavioural walkthrough system that exploits sequence-based semantic-oriented clustering techniques, such as association, intra-relationships, and inter-relationships, to explore additional links throughout the behavioural walkthrough system. The experimentation shows that in such cases the use of so-called I/O-efficient algorithms that minimize the number of disk accesses can lead to tremendous runtime improvements.


2015 ◽  
Vol 8 (12) ◽  
pp. 1566-1577 ◽  
Author(s):  
Foteini Katsarou ◽  
Nikos Ntarmos ◽  
Peter Triantafillou

Sign in / Sign up

Export Citation Format

Share Document