Unlock instant, AI-driven research and patent intelligence for your innovation.

An optimization method for releasing relational data as XML document using buffer memory

An optimization method and technology of relational data, applied in the direction of electrical digital data processing, special data processing applications, transmission systems, etc., can solve problems such as affecting system efficiency

Inactive Publication Date: 2005-06-29
FUDAN UNIV
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, each release work needs to be carried out again, which affects the system efficiency

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
  • An optimization method for releasing relational data as XML document using buffer memory
  • An optimization method for releasing relational data as XML document using buffer memory
  • An optimization method for releasing relational data as XML document using buffer memory

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0076] (1) Frequent release of examples of root-subtree mining algorithms

[0077] For example, assume that all PRTs in the PRT database are synthesized into a global tree G-PRT, such as figure 2 Among them, a is G-PRT, use the algorithm FPT to obtain FPRST: the first thing to do is to enumerate all side subtrees PRST of G-PRT 1 ,like figure 2 Among them, (b) is one side subtree PRST of G-PRT shown in (a) 1 . Then count each PRST 1 The number of occurrences of , using the pre-defined minSupp to determine F 1 ; In the example of this article, F 1 There is no need to calculate the number of occurrences to determine whether it is frequent, because the root node has only one child node, so it must be frequent. Then according to G-PRT from F 1 Obtain the two-side candidate set C 2 , is in the PRST 1 On the basis of G-PRT, just add a node. like figure 2 The set of (c), (d), (e) in is C 2 .

[0078] Then the C obtained using the algorithm Contains pair 2 Each PRST in...

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

This invention relates to an optimization method to issue the relation data as XML form file. It adopts the requirements and its relation of users frequent memory to speed up the user issuing. It provides the concepts of issuing requirement tree, root tree, frequent issuing root tree and two relative arithmetic methods, that are frequent issuing root digging method and user issuing tree matching method. It also provides a system frame by use of buffer optimization issuing problem.

Description

technical field [0001] The invention belongs to the technical field of XML release, and in particular relates to an optimization method for releasing relational data as an XML document by using cache. Background technique [0002] With the development of the Web (Network), XML (Extensible Markup Language) is gradually becoming the standard for data representation and exchange on the Web. However, because the relational database system technology is mature, and has good stability and processing performance, a large amount of enterprise data is stored in the relational database. In order to exchange and integrate data on the Web, relational data needs to be published as XML format documents. For example, the data in a data source node of an enterprise is stored in a relational database. When a request node in the Web network makes a request, the data source node needs to transmit the data required by the request node to the request node through the network. This is a very pr...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30H04L29/06
Inventor 邱洋周傲英
Owner FUDAN UNIV