Abstract
With the rapid growth of the scale of the graph data, the form of its organization is more complicated. Heterogeneous information network has become an important tool for management and mining of graph data. It has been widely used in Chinese information processing, learning community mining and online shopping. The accessibility problem of heterogeneous information network is the basic problem of its research. Based on the literature [1], this paper proposes a path-based reachability query algorithm based on query preference. The algorithm establishes the path pattern index by preprocessing step, and uses the query preference to update the above indexes to achieve better processing the purpose of online inquiries. The experiment proves the effectiveness of the proposed method.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
