Font Size: a A A

The Research Of The Information Distribution Model Based On Information Attribute

Posted on:2016-07-13Degree:MasterType:Thesis
Country:ChinaCandidate:J L LiFull Text:PDF
GTID:2298330467492760Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Nowadays with the rapid development of information technology, advanced degree ofinformation technology research has become a national symbol of modernization level andcomprehensive strength. In today’s development trend, in the future, the owner who possessesthe faster information distribution technology and more access to information will become thedominant in the competition between the countries and enterprises, and will be in the lead. Insuch a rapid development of social environment, information distribution service systemarises at the historic moment. Among them, the main direction of the research is how tocomplete the precise matching and rapid distribution on the premise of guaranteeing theinformation reliability and real-time performance when the information resource weredistributed. Especially in today’s society, the development of technology leads more and morekinds information to being distributed, including some information whose data is relativelysmall and some image files that have high resolution and large amount of data. It increasedthe difficult of real-time distributed information to require the distribution information fasterand more accurate.In this paper, we study a new information distribution model. First of all, compute thecorresponding priority of information on the basis of information attribute such as timelinessand urgent, after studied the attribute of the information. By JDOM technology, packaging thepriority into the XML message with other important attribute to prepare for later precisionmatching.In order to further speed up the ordering of messages in the queue, propose a queueinsertion sort algorithm based on the percentage in the full study binary insertion sortalgorithm thought. The algorithm will calculate the message position in the queue, by meansof utilizing the percentage of the priority of the message to be enqueued and already in thequeue. Compared with binary insertion method, it decreases the sorting time by decreasing the number of comparison, in order to improve the sorting efficiency.Finally, XPath matching strategy is used in the matching process. Given an XPathexpression which contains all the query mode, an XML message, if the message match somesubscription in the expression, the message will be pushed to the subscriber who put forwardthat subscription.
Keywords/Search Tags:information attribute, XML, sort algorithm, XPath matching strategy
PDF Full Text Request
Related items