Distributed Pattern Matching: Cycle-Based Query Optimization
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 114 | Views: 309

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 4 Issue 4, April 2015 | Popularity: 6.4 / 10


     

Distributed Pattern Matching: Cycle-Based Query Optimization

Rajshri G. Deshmukh, Praful B. Sambhare


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


Keywords: Subgraph, Pattern matching, Query processing, Subgraph isomorphism, Distributed pattern matching, Graph simulation


Edition: Volume 4 Issue 4, April 2015


Pages: 2395 - 2398



Please Disable the Pop-Up Blocker of Web Browser

Verification Code will appear in 2 Seconds ... Wait



Text copied to Clipboard!
Rajshri G. Deshmukh, Praful B. Sambhare, "Distributed Pattern Matching: Cycle-Based Query Optimization", International Journal of Science and Research (IJSR), Volume 4 Issue 4, April 2015, pp. 2395-2398, https://www.ijsr.net/getabstract.php?paperid=18041506, DOI: https://www.doi.org/10.21275/18041506

Top