Distributed Pattern Matching: Cycle-Based Query Optimization
Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 4)Publication Date: 2015-04-05
Authors : Rajshri G. Deshmukh; Praful B. Sambhare;
Page : 2395-2398
Keywords : Subgraph; Pattern matching; Query processing; Subgraph isomorphism; Distributed pattern matching; Graph simulation;
Abstract
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high expressive power to model complicated structures. Greedy algorithms for subgraph pattern matching operations are often sufficient when the graph data set can be held in memory on a single machine. However, as graph data sets increasingly expand and require external storage and partitioning across a cluster of machines, more sophisticated query optimization techniques become critical to avoid explosions in query latency. In this paper, there is query optimization technique for distributed graph pattern matching
Other Latest Articles
- Securing Mobile Ad-Hoc Network by Discovering and Verifying Neighborhood
- Quantitative Analysis of Drivers Affecting Green Supply Chain Management in Rajasthan SME?S
- Utility of Desmin in Morphological Diagnosis of Rhabdomyosarcoma
- Structural Analysis of Airborne Radiometric data for Identification of Kimberlites in Parts of Eastern Dharwar Craton
- Active Antenna for VHF Band Applications
Last modified: 2021-06-30 21:44:39