Abstract
This paper presents a quickly locate the query methods in the face of huge amounts of data. The method by analyzing the data relationship, split the database, the formation of cross-database quickly Hash positioning table, and by analyzing the query cost to build double weighted graph and weight table. Each query is given based on the node weight table fast cross-database query path, and quickly locate the target from the cross-database positioning Hash table Hash calculation, in order to achieve fast positioning method.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
