XML air indexing method in air broadcast

A wireless broadcasting and indexing technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem of no XML air indexing method, and achieve the effect of reducing redundancy and size

Inactive Publication Date: 2010-06-30
FUDAN UNIV
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0012] Based on the above analysis, there is no effective XML air index method before the present invention

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • XML air indexing method in air broadcast
  • XML air indexing method in air broadcast
  • XML air indexing method in air broadcast

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0031] There are 5 XML documents in a database, respectively d 1 、d 2 、d 3 、d 4 and d 5 , the structure of each document is attached figure 1 shown in (a).

[0032] Step 1: Build DataGuide for each XML document in the database, the result is attached figure 1 (b) shown. take document d 1 For example, d 1 There are two identical child nodes b under the root node a, but in d 1 In the corresponding DataGuide, the root node a retains only one child node b.

[0033] Step 2: Attach figure 1 The five DataGuides in (b) are merged, and the results are as attached figure 2 shown. The identifiers in parentheses represent the node numbers in the merged index, and the numbers of documents matched by each node are displayed below the node. Documentation can be found d 1 , d 2 , d 3 , d 5 All have paths of / a / b, and only one path of / a / b is kept in the merged index, which eliminates the redundancy caused by the same path between different documents.

[0034] Step 3: Prune ...

Embodiment 2

[0036] In this embodiment, the Java 1.4.2 compilation environment is used, and the simulation test is carried out on the Linux 2.6 platform. The experimental objects are 500 XML documents defined by News Industry Text Format (NITF) DTD, which are generated by IBM’s XMLGenerator and 100 to 1000 queries (expressed by XPath), which are generated by the XPath generator in YFilter[30]. The default The query maximum path length is set to 10. The specific results are attached Figure 4 And attached Figure 5 .

[0037] attached Figure 4 Shown is the effect of the number of queries on the effect of the merge. We use the merger rate to evaluate the effect of the merger, and the definition of the merger rate is as follows:

[0038]

[0039] From attached Figure 4 It can be seen that as the number of queries increases, the merging rate decreases slowly, because more and more path information needs to be preserved to ensure that the query can correctly match the corresponding X...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an XML air indexing method in an air broadcast, which mainly comprises a basic index structure based on DataGuide, an index merging technology and an index pruning technology. The whole process is as follows: firstly, building a corresponding DataGuide index for each XML document in a database, then merging the DataGuide into a complete indexing based on the whole database, and finally pruning the complete indexing and deleting the datanode which is not visited by any request in a request queue. By the merging and pruning technologies, the invention can reduce the size of the indexing to about 0.1% to 0.5% of a data document, and thereby greatly reducing the tuning time of users and improving the performance of a broadcasting system.

Description

technical field [0001] The invention belongs to the intersection field of wireless data broadcasting and XML document indexing, and specifically relates to an XML air indexing method in a wireless network. Background technique [0002] With the popularity of wireless devices and the development of wireless networks, wireless mobile computing has become a very active research field, and wireless data broadcasting has become a widely used method in wireless mobile networks due to its unique scalability and full use of bandwidth. Data transfer method. [0003] How to access quickly and save energy are two main issues studied in wireless data broadcasting. Correspondingly, there are two main parameters for evaluating broadcast performance: access time (Access Time) and tuning time (TuningTime) [0004] Access time is the time elapsed between when a user makes a request and when the request is fulfilled. [0005] Tuning time is the amount of time a user needs to stay listening...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 孙未未覃泳睿余平张卓瑶
Owner FUDAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap