Dissertation > Excellent graduate degree dissertation topics show

Research Coding and Query Algorithm of Graph Structure with Cycle

Author: MaFuNing
Tutor: LuYan
School: Shandong University of Science and Technology
Course: Computer Software and Theory
Keywords: Graph Accessible Query XML
CLC: TP301.6
Type: Master's thesis
Year: 2011
Downloads: 2
Quote: 0
Read: Download Dissertation

Abstract


With the developing of xml technology. The area of management and query technology on cycle graph-structured attracts more and more people to research. And the technology to deal with the question of the cycling on graph-structured is becoming popular, how to provide a code algorithm to process circle base on graph-structured and design a query algorithm has became main direction on XML.Because of the interval encoding is not apply to the research the graph-structure, and the interval encoding must be to judge mass data from the graph usually produce large middle result, therefore seriously reduce query efficiency.It not to be used to solve the relationship of ancester or parents between nodes on directed cycle graph, so we need to find a new algorithm, this algorithm is solved by the relationship database, as to improve coding rate and saving space. Decrease the encoding time. For the query algorithm on cycle graph, most of the algorithm is development base on the tree-structure,so it is not apply to query on the graph-structure.In this paper, a new encoding algorithm on graph-structure are presented, and this method use the depth finding strategy and set up the flag to deal with the question of display circle on graph-structure. Avoid storing a great deal of middle result, and it can determine the reachable relation between any two nodes in very short time. Based on this conclusion, this paper provide another query method, which flowing this method traversing all nodes of query graph once in graph, and judge reachable relation, at last get the result of the query. Query result is represented by code of nodes. with small storage space and have a high efficiency.In this paper, research the query technology base on the CUDA algorithm and give up the interval coding and subgraph query, use the triple to solve the question of accessible query, put the result in the list table, compare with the HGjoin query that store the result in Alist and Dlist tables only in half the space the same data, because abandoned the interval coding do not need to repeating the result sets, to raise in rate.

Related Dissertations

  1. Research and Implementation on Knowledge Representation of Gene Regulatory Network,Q78
  2. Reseach on Optimal Control of Elevator Group Based upon Ant Colony Algorithm,TU857
  3. Research and Implement of SDO Model in University Enroll System Based on SOA,G647
  4. Research on F&B Index Structure Supporting XML Query,TP311.13
  5. Research on Parallel Frequent Graph Pattern Mining,TP311.13
  6. Research on Integration Technologies of LXI Automatic Test System,TP274
  7. Fault Diagnosis Method Based on Support Vector Machine,TP18
  8. The Study and Development of Web-Based Apparel Style Design System,TS941.2
  9. Research on the Method of Interface Automatic Generation Based on MDA,TP311.5
  10. Method of mapping UML models to XMI,TP311.5
  11. Research and Design of a C++ Codes Defect Detection System,TP311.53
  12. Web-based scientific computing legacy application sharing technology research,TP393.09
  13. To Search the Font from the Graphics,J524
  14. Design and Implementation of Heterogeneous Data Exchange System Based on XML,TP311.52
  15. Electronic Document Transmission Management System in RTVU System of Design and Implementation,TP311.52
  16. Research and Implementation of Keyword Search in Probabilistic XML Data,TP391.3
  17. The Research of the Harmony Paragenesis Graphics in China,J522
  18. Design and Implementation on Data Exchange of Electronic Supervising System of Governmental Examining and Approval,TP311.52
  19. Study on Holistically Twig Matching Algorithm Over Probabilistic XMLs,TP311.13
  20. Research of Bi-directional Transformation between XML Data and Relational Data with Semantic Constraints,TP311.13
  21. Design and Simulated Implementation of Protection Routing Algorithms Based on the Sharable Degree of Wavelengths and the Number of Ports Constraint in WBS Networks,TN929.1

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods > Algorithm Theory
© 2012 www.DissertationTopic.Net  Mobile