CN111737539A - Complex report engine method and device - Google Patents
Complex report engine method and device Download PDFInfo
- Publication number
- CN111737539A CN111737539A CN202010858117.9A CN202010858117A CN111737539A CN 111737539 A CN111737539 A CN 111737539A CN 202010858117 A CN202010858117 A CN 202010858117A CN 111737539 A CN111737539 A CN 111737539A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- complex
- nodes
- cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/174—Form filling; Merging
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/186—Templates
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a complex report engine method and a complex report engine device, which mainly solve the problems that the prior complex report engine method in the prior art has no unified maintenance and low access efficiency, so that logic separation and line process pass through a plurality of stages and the derivation consumes long time. The complex report engine method and the device are characterized in that firstly, one or N trees in an initial state are generated based on a report template configured by a user, and a plurality of trees can be crossed; and then, sequentially loading data layer by layer from the root node to the leaf node of each tree, and copying the tree nodes and the distribution values according to the number of the data. Then, the copied node is copied together with the child nodes, so as to generate a new tree. And finally, uniformly maintaining the nodes with the same hierarchy expanded from the same template tree node through a linked list. By the scheme, the invention achieves the purposes of low memory overhead and quick derivation.
Description
Technical Field
The invention relates to the technical field of data query and engines, in particular to a complex report engine method and a complex report engine device.
Background
People usually record various data by using a computer in daily life, and reports on the computer are mainly characterized by data dynamism and diversified formats, complete separation of report data and report formats is realized, and users can only modify data or only modify formats.
The engine method in the prior art for complex reports is that the query result data is used as an entry point, the relationship between nodes is described through a multi-layer nested hash table structure, the size of the hash table depends on the number of field values, and the nested level depends on the level depth of a parent lattice and a child lattice.
The above complex reporting engine approach has some problems: fields of the same type and the same level are usually distributed in a plurality of hash tables, so that uniform maintenance is not realized and the access efficiency is low; the nested structure of the hash table determines the quick access characteristic from an upper layer to a lower layer, but a separate data structure is needed to realize from the lower layer to the upper layer, so that the logic separation is caused; the design idea of the current scheme is to load data and complete cell calculation, then form a nested hash table structure, and finally complete derivation, wherein the execution process is in multiple stages, and the derivation is time-consuming.
Disclosure of Invention
The invention aims to provide a complex report engine method and a complex report engine device, which are used for solving the problems of logic separation and line process passing through a plurality of stages and long derivation time consumption caused by the lack of uniform maintenance and low access efficiency of the conventional complex report engine method.
In order to solve the above problems, the present invention provides the following technical solutions:
a complex report engine method comprises the following steps:
s1, generating one or N trees in an initial state according to a report template configured by a user;
s2, sequentially loading data layer by layer from the root node to the leaf node of each tree in the step S1;
s3, copying tree nodes and distribution values according to the data strip number in the step S2 to generate a new tree;
s4, repeating the steps S2 and S3 to finish the data loading;
and S5, uniformly maintaining the nodes with the same hierarchy expanded from the same template tree node through a linked list.
The complex report engine method is based on an improved B-tree algorithm, the complex report is deduced hierarchically and in a parent-child relationship, the cells can be loaded and copied based on a self-defined template, and the complex table with the hierarchical and grouping relationships is deduced and generated, and a tree algorithm and an inertia evaluation method are adopted in the process, so that the complex report engine method has the advantages of high deduction speed, low memory overhead, flexible formula use and the like, wherein a linked list can realize quick access to all cells with the same parent cell; the method solves the problems of the existing complex report calculation algorithm based on the nested list.
Further, in step S1, when there are multiple trees, the trees may or may not be intersected; when trees are crossed, one node has at most two father nodes.
Further, the node copied in step S2 is copied together with the child nodes, so as to generate a new tree; the new tree represents the cells copied and newly generated by the template cells.
Further, the tree in step S1 is of a symmetrical or asymmetrical structure; the initial structure of the tree is designed by a user in a self-defined way and can be in any form, and the method has the advantages that no limitation of the form of the template exists, and the user can match the template in any form.
Further, the data loaded in steps S2 through S4 are cell data having a fixed order according to the configuration of the corresponding cell of the current node; storage and access are facilitated.
Further, the fixed sequence is any one of ascending sequence, descending sequence and custom sequencing.
A complex report engine device comprises
A memory: for storing executable instructions;
a processor: the method is used for executing the executable instructions stored in the memory and realizing the complex report engine method.
Compared with the prior art, the invention has the following beneficial effects:
(1) the invention realizes the hierarchical derivation of the complex report, loads data from the root node to the leaf node layer by layer and copies the data to form a cell group, each copied cell and the sub-cells form a new sub-tree, and the derivation process does not change the tree hierarchy.
(2) According to the complex report hierarchical derivation strategy, the derivation process is split, an inertia evaluation algorithm is introduced in the single-level derivation process, and the coordinate positions are uniformly calculated after all nodes in the hierarchy are derived, so that the calculation delay is realized, and unnecessary calculation operation in the derivation process can be reduced.
(3) The bidirectional linked list has higher efficiency when acquiring a plurality of continuous packets or full packets of a certain type of cells, and can avoid complex scanning operations such as node traversal and the like.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts, wherein:
FIG. 1 is a tree structure adopted by a complex report derivation algorithm.
Fig. 2 is a schematic topological diagram of fig. 1.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to fig. 1 to 2, the described embodiments should not be construed as limiting the present invention, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.
Before further detailed description of the embodiments of the present invention, terms and expressions mentioned in the embodiments of the present invention are explained, and the terms and expressions mentioned in the embodiments of the present invention are applied to the following explanations.
And (4) complex report forms: a two-dimensional table with a complex hierarchical relationship is named (Report). The complex report comprises dimension and measurement indexes, supports horizontal or vertical typesetting on a single index or a group of indexes, and supports grouping display or direct detailed display on the indexes according to a plurality of dimension combinations.
A report template: a set of styles, all called (Report templates), that define the form of the Report. The report template is composed of a group of cells and comprises information such as cell elements, cell coordinates, cell relations and cell conditions. And (4) carrying out data loading and cell derivation based on the report template, and generating a complex report.
Cell: the minimum unit of the report corresponds to a specific index attribute, namely (Cell). The cells are used as containers of indexes to store index values, and one or more cells can be generated according to index value taking results. The cells support three expansion modes of horizontal expansion, vertical expansion and non-expansion, and the position of each cell can be identified through a horizontal and vertical coordinate point.
Merging the cells: and combining the plurality of cells to form the cross-row and cross-column cells. The position of the merged cell contains two attributes of horizontal span (RowSpan) and vertical span (ColSpan) besides the horizontal and vertical coordinate starting point, and other attributes are the same as the cell. The generation of the merged cells has two scenes, one is defined in the template configuration, and the other is that the factor cells are expanded and spread in the derivation process (the essence is cell merging).
Cell association: the association relationship between cells, a cell has a single or a plurality of but at most two father cells, and a cell can have a plurality of child cells. After the cells are associated, a non-directional ring is not allowed to be formed, and the cells may not have symmetry (that is, the number of link nodes of two cells upward in the same cell may not be equal). Usually, the parent-child lattice relationship corresponds to the hierarchical relationship of the indexes, and the cross table is a special form in which one cell has two parent cells.
Cell conditions: a filter condition is applied to the cell index value. The filtering condition can affect the final result of loading the cell index value, and the filtering field can be the current cell index or the parent cell of any level of the current cell.
Cell sorting: an ordering rule applied on the cell index value. The sorting rule only influences the display sequence of the index values and does not influence the number of the results. The ordering supports ascending and descending, and the rule can be the value of the current cell or the values of other cells (namely, the current cell is mapped according to the ordering of the values of other cells, and the two cells imply a binding relationship of 1 to 1).
Example 1
As shown in fig. 1, a complex report engine method generates one or N trees in an initial state as a template tree for a report template configured by a user, where nodes of the template tree represent a dimension or a measurement index, and the index value is a set; the derivation process is to load the data values of the nodes layer by layer from the root node to the leaf node of the tree, and the data loading supports the calculation formula from a database, a user-defined constant value and other indexes; when the template tree node finishes data loading, node replication is carried out, the node replication is carried out together with child nodes, and the essence is that a plurality of sub-trees taking the current node as a root node are replicated; finally, the data loading and copying processes are applied to each node of the template tree and a new node generated by copying, and a hierarchical and sequential set tree consisting of N large and small data is finally formed; then uniformly maintaining nodes with the same level expanded from the same template tree node through a linked list; wherein, the tree is a symmetrical or asymmetrical structure.
Each node of the tree represents a cell in the complex report, the cell has some columns of data such as position, numerical value, form, parent-child relationship and the like, and the new tree represents a cell copied and newly generated by the template cell; the tree level is fixed at the initial template, and the level of each cell, namely the level and the position of the template cell corresponding to the current cell in the template tree, are not changed no matter how the subsequent cells are copied.
The hierarchical derivation is to expand cells from root nodes to leaf points level by level, load data copy cells and subtrees thereof, and connect the cells in series by using a linked list; the method is characterized in that a lazy evaluation algorithm is adopted during single-level derivation, each level is provided with a batch of cell nodes to be expanded, the expansion and the replication of the cells are sequentially carried out essentially, the expansion values of the cells are loaded during operation, the number of the values is not fixed, the positions of the cells which are expanded historically and are not expanded in the future are not fixed, and therefore the positions of other cells need to be recalculated when one cell is expanded, so that the efficiency is greatly reduced, lazy evaluation is introduced, firstly, one group of cells only maintain one initial position, each cell is expanded, other groups of cells only record position change information, and finally, the positions of the cells are uniformly calculated after all the cells of the level are expanded.
Example 2
The present embodiment is further based on embodiment 1, where multiple trees in step S1 are crossed or not crossed; when trees are crossed, one node has at most two father nodes; that is, the same node belongs to at most two trees, and there is no restriction between different nodes.
Example 3
The present embodiment is further based on embodiment 1, wherein the data loaded in steps S2 to S4 is cell data having a fixed order according to the configuration of the corresponding cell of the current node; the fixed sequence is any one of ascending sequence, descending sequence and custom sequence; and sequencing and sequential fixed line are carried out during data loading, secondary sequencing is not required to be carried out on the copying and arrangement of subsequent subtrees, and the derivation requirement can be met.
Tree cell nodes are of three types: database field, user-defined constant field and calculation function field. Under the field scene of the calculation function, the scene of calculation based on the offset node application formula exists, and the access time complexity of O (1) can be realized by adopting an ordered storage structure.
Example 4
In this embodiment, on the basis of embodiment 1, a complex report engine device includes
A memory: for storing executable instructions;
a processor: the method is used for executing the executable instructions stored in the memory and realizing the complex report engine method.
Example 5
As shown in fig. 1 and fig. 2, the ReportCtx is context information of the complex report, wherein the CellHead field corresponds to the template node and serves as a list header to maintain all node groups expanded by the node. Each node group has CellCtx context information and records father nodes, cell sequences in the group, cell value sequences in the group and other information. The solid line rectangles represent template cells, the dotted line rectangles represent cells copied from the template cells, and each cell group is composed of one template cell and a plurality of copied cells. The template cells may also be newly generated during the derivation process, but are ultimately derived from the original template cells. In general, the algorithm generates a plurality of trees, the number of the trees increases as the hierarchy deepens, the plurality of trees which are located in the same hierarchy and have uniform attributes are uniformly maintained by a node group (i.e., CellCtx) to which a root node belongs, and the orderliness of the root node and among the plurality of trees is determined by the orderliness of cells in the node group.
The core of the invention is the copying of a plurality of nodes and the recombination of trees, the hierarchy and the form of the trees are not changed in the period, and the number of the node copying and the number of the recombination trees are subject to the loading result of the node value; the algorithm uniformly maintains the same type of cell groups through a linked list, the time complexity of randomly accessing a certain node is (O (1) -O (d)) + O (1), wherein O (1) -O (d) are divided into the time complexity of randomly acquiring a cell group (CellCtx), and O (1) is the time complexity of accessing a specific cell in the cell group.
The algorithm introduces the two-way linked list, has higher efficiency when acquiring a plurality of continuous packets or full packet data of a certain type of cells, and can avoid complex scanning operations such as node traversal and the like; the method is mainly used for a complex report deduction function in a BI product, and is used for performing table expansion according to dimension indexes and measurement indexes, performing global typesetting according to a hierarchical relationship and coordinate information, and finally forming a complex two-dimensional table.
The method solves the deduction requirement of the complex report in the BI scene, reduces repeated data by multiplexing Context information, reduces the calculation frequency by using an inertia evaluation method, can control the memory consumption within 200M (about 60 percent of the memory occupation ratio of a cell data part) under the deduction scene of 100 ten thousand cells by using the complex report engine, has the total report rendering time of less than 3 seconds, and solves the problems of high memory overhead and slow deduction in the past.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (7)
1. A complex report engine method is characterized by comprising the following steps:
s1, generating one or N trees in an initial state according to a report template configured by a user;
s2, sequentially loading data layer by layer from the root node to the leaf node of each tree in the step S1;
s3, copying tree nodes and distribution values according to the data strip number in the step S2 to generate a new tree;
s4, repeating the steps S2 and S3 to finish the data loading;
and S5, uniformly maintaining the nodes with the same hierarchy expanded from the same template tree node through a linked list.
2. The complex reporting engine method as in claim 1, wherein in step S1, the trees are crossed or not crossed; when trees are crossed, one node has at most two father nodes.
3. The method according to claim 1, wherein the node copied in step S2 is copied together with the child nodes, thereby generating a new tree.
4. The method of claim 1, wherein the tree in step S1 is a symmetrical or asymmetrical structure.
5. The complex reporting engine method as in claim 1, wherein the data loaded in steps S2 through S4 is cell data having a fixed order according to the configuration of the corresponding cell of the current node.
6. The complex reporting engine method of claim 5, wherein the fixed order is any one of ascending order, descending order, and custom ordering.
7. A complex report engine device is characterized by comprising
A memory: for storing executable instructions;
a processor: for executing executable instructions stored in said memory, implementing a complex reporting engine method as claimed in any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010858117.9A CN111737539A (en) | 2020-08-24 | 2020-08-24 | Complex report engine method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010858117.9A CN111737539A (en) | 2020-08-24 | 2020-08-24 | Complex report engine method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111737539A true CN111737539A (en) | 2020-10-02 |
Family
ID=72658680
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010858117.9A Pending CN111737539A (en) | 2020-08-24 | 2020-08-24 | Complex report engine method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111737539A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112528613A (en) * | 2020-12-21 | 2021-03-19 | 金蝶软件（中国）有限公司 | Data table generation method and related equipment thereof |
| CN113761859A (en) * | 2021-11-09 | 2021-12-07 | 武汉先峰数据有限公司 | Electronic report definition method and device and electronic equipment |
| US20220028137A1 (en) * | 2020-12-03 | 2022-01-27 | Beijing Baidu Netcom Science Technology Co., Ltd. | Method for generating electronic report, electronic device, and storage medium |
| WO2024001308A1 (en) * | 2022-06-30 | 2024-01-04 | 武汉高德智感科技有限公司 | Template-based batch generation method and apparatus for infrared thermal image analysis reports |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050091188A1 (en) * | 2003-10-24 | 2005-04-28 | Microsoft | Indexing XML datatype content system and method |
| US20060218176A1 (en) * | 2005-03-24 | 2006-09-28 | International Business Machines Corporation | System, method, and service for organizing data for fast retrieval |
| CN102004975A (en) * | 2010-12-30 | 2011-04-06 | 畅捷通软件有限公司 | Report column generating method and device |
| CN106407371A (en) * | 2016-09-09 | 2017-02-15 | 广州神马移动信息科技有限公司 | User comment data displaying method and system, server and client |
| CN106649225A (en) * | 2016-12-30 | 2017-05-10 | 冶金自动化研究设计院 | JSON self-definition-based report generation system and method |
| CN108804401A (en) * | 2018-06-14 | 2018-11-13 | 南京云帐房网络科技有限公司 | A kind of merging method and device of report form template |
| CN109800401A (en) * | 2018-12-25 | 2019-05-24 | 北京数知科技股份有限公司 | Information report automatic generation method and device |
| CN111522819A (en) * | 2020-04-24 | 2020-08-11 | 上海用天网络科技有限公司 | Method and system for summarizing tree-structured data |
-
2020
- 2020-08-24 CN CN202010858117.9A patent/CN111737539A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050091188A1 (en) * | 2003-10-24 | 2005-04-28 | Microsoft | Indexing XML datatype content system and method |
| US20060218176A1 (en) * | 2005-03-24 | 2006-09-28 | International Business Machines Corporation | System, method, and service for organizing data for fast retrieval |
| CN102004975A (en) * | 2010-12-30 | 2011-04-06 | 畅捷通软件有限公司 | Report column generating method and device |
| CN106407371A (en) * | 2016-09-09 | 2017-02-15 | 广州神马移动信息科技有限公司 | User comment data displaying method and system, server and client |
| CN106649225A (en) * | 2016-12-30 | 2017-05-10 | 冶金自动化研究设计院 | JSON self-definition-based report generation system and method |
| CN108804401A (en) * | 2018-06-14 | 2018-11-13 | 南京云帐房网络科技有限公司 | A kind of merging method and device of report form template |
| CN109800401A (en) * | 2018-12-25 | 2019-05-24 | 北京数知科技股份有限公司 | Information report automatic generation method and device |
| CN111522819A (en) * | 2020-04-24 | 2020-08-11 | 上海用天网络科技有限公司 | Method and system for summarizing tree-structured data |
Non-Patent Citations (3)
| Title |
|---|
| 丁娟: "基于单元格扩展的报表引擎的研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 周晶莹: "基于XBRL的财务报告存储与分析系统", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 蔡其灿: "浙江省政务移动办公系统的设计与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220028137A1 (en) * | 2020-12-03 | 2022-01-27 | Beijing Baidu Netcom Science Technology Co., Ltd. | Method for generating electronic report, electronic device, and storage medium |
| US11657550B2 (en) * | 2020-12-03 | 2023-05-23 | Beijing Baidu Netcom Science And Technology Co., Ltd. | Method for generating electronic report, electronic device, and storage medium |
| CN112528613A (en) * | 2020-12-21 | 2021-03-19 | 金蝶软件（中国）有限公司 | Data table generation method and related equipment thereof |
| CN113761859A (en) * | 2021-11-09 | 2021-12-07 | 武汉先峰数据有限公司 | Electronic report definition method and device and electronic equipment |
| CN113761859B (en) * | 2021-11-09 | 2022-04-12 | 武汉先峰数据有限公司 | Electronic report definition method and device and electronic equipment |
| WO2024001308A1 (en) * | 2022-06-30 | 2024-01-04 | 武汉高德智感科技有限公司 | Template-based batch generation method and apparatus for infrared thermal image analysis reports |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111737539A (en) | Complex report engine method and device | |
| US6631386B1 (en) | Database version control subsystem and method for use with database management system | |
| US6557012B1 (en) | System and method of refreshing and posting data between versions of a database table | |
| CN112269792B (en) | Data query method, device, equipment and computer readable storage medium | |
| March | Techniques for structuring database records | |
| JP2003517165A (en) | System for managing RDBM fragmentation | |
| Ezeife et al. | Distributed object based design: Vertical fragmentation of classes | |
| CN112765405A (en) | Method and system for clustering and inquiring spatial data search results | |
| CN110851616A (en) | RDF knowledge graph storage and management method based on domain subgraphs | |
| CN115114294A (en) | Self-adaption method and device of database storage mode and computer equipment | |
| Giao et al. | Improving sort-tile-recusive algorithm for r-tree packing in indexing time series | |
| Kantabutra et al. | Using the Newly‐created ILE DBMS to Better Represent Temporal and Historical GIS Data | |
| Al-Hamodi et al. | An enhanced frequent pattern growth based on MapReduce for mining association rules | |
| CN113704248A (en) | Block chain query optimization method based on external index | |
| CN116257636A (en) | Unified management method and device for enumerated data dictionary, electronic equipment and storage medium | |
| Bhargavi et al. | Graph pattern mining: A survey of issues and approaches | |
| Arseneau et al. | STILT: Unifying spatial, temporal and textual search using a generalized multi-dimensional index | |
| Eom et al. | Efficient generation of spatiotemporal relationships from spatial data streams and static data | |
| Mullangi et al. | SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies | |
| Genrikhov et al. | Finding frequent elements for a product of partial orders and association rules | |
| Lin et al. | A rapid incremental frequent pattern mining algorithm for uncertain data | |
| Carlis et al. | A descriptive model of physical database design problems and solutions | |
| Salzberg | Access methods | |
| CN112148830A (en) | Semantic data storage and retrieval method and device based on maximum area grid | |
| Kaporis et al. | ISB-tree: A new indexing scheme with efficient expected behaviour |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201002 |
|
| RJ01 | Rejection of invention patent application after publication |