# US 11,308,083 B2 · Automatic transformation of complex tables in documents into computer understandable structured format and managing dependencies > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,308,083 B2 - Document ID: US11308083B2 - Status: Granted - Kind: B2 - Application number: 16/389,123 - Filed: 2019-04-19 - Published: 2020-10-22 - Granted: 2022-04-19 - Earliest claimed: 2019-04-19 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: Mustafa Canim; Cristina Cornelio; Arun Iyengar; Ryan A. Musa; Mariano Rodriguez Muro - Web page: https://patentgrep.com/patent/US11308083B2 ## CPC - G06F 16/24522: {Translation of natural language queries to structured queries} - G06F 16/2282: {Tablespace storage structures; Management thereof} - G06F 16/2456: {Join operations} - G06F 16/2458: Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries - G06F 16/252: {between a Database Management System and a front-end application} - G06F 16/258: {Data format conversion from or to a database} - G06F 16/285: {Clustering or classification} - G06F 40/157: using dictionaries or tables - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract An information processing system, a computer readable storage medium, and a computer-implemented method, collect tables from a corpus of documents, convert the collected tables to flattened table format and organized to be searchable by schema-less queries. A method collects tables, extracts feature values from collected table data and collected table meta-data for each collected table. A table classifier classifies each collected table as being a type of table. Based on the classifying, the collected table is converted to a flattened table including table values that are the table data and the table meta-data of the collected table. Dependencies of the data values are mapped. The flattened table and mapped dependencies are stored in a triple store searchable by schema-less queries. The table classifier learns and improves its accuracy and reliability. Dependency information is maintained among a plurality of database tables. The dependency information can be updated at variable update frequency. ## Claims ### Claim 1 In a computer system comprised of a memory repository in which is stored a set of tables and a processor communicatively coupled to the memory repository and thereby to the stored set of tables, a computer-implemented method for maintaining dependency information among the set of tables, the method comprising: providing a set of flattened tables stored in a memory repository in a computer system, each flattened table in the set of flattened tables including table data and table meta-data converted from a compact table collected from a corpus of documents, the set of flattened tables organized to be searchable by schema-less queries; determining a plurality of dependent objects in the set of flattened tables, wherein a dependent object comprises all or part of a flattened table in the set of flattened tables, and wherein the processor maintains and updates dependency information stored in the memory repository, the stored dependency information maps dependency between dependent objects in the plurality of dependent objects in the set of flattened tables thereby organized to be searchable by schema-less queries, and wherein a frequency of access is stored in memory for each dependent object in the plurality of dependent objects; determining a frequency of access for each of the plurality of dependent objects; in response to an access frequency of a dependent object exceeding a threshold, maintaining and updating dependency information corresponding to the dependent object stored in the memory repository; and in response to the access frequency for the dependent object falling below the threshold, ceasing to maintain dependency information for the dependent object stored in the memory repository. ### Claim 2 (depends on 1) The method of claim 1, further comprising: maintaining a first copy of said dependency information in persistent storage and maintaining a second copy of said dependency information in main memory. ### Claim 3 (depends on 1) The method of claim 1, further comprising: using the frequency of access for each of the plurality of dependent objects to determine a frequency of updating dependency information for each of the plurality of dependent objects. ### Claim 4 (depends on 3) The method of claim 3, further comprising: assigning a fixed number of update frequencies to the plurality of dependent objects. ### Claim 5 (depends on 3) The method of claim 3, wherein a frequency of updating dependency information for a dependent object is proportional to a frequency of access for the dependent object. ### Claim 6 (depends on 3) The method of claim 3, wherein a frequency of updating dependency information for dependent objects monotonically increases with a frequency of access for the dependent objects. ### Claim 7 (depends on 3) The method of claim 3, wherein a frequency of updating dependency information for a first dependent object with a frequency of access above a threshold is higher than a frequency of updating dependency information for a second dependent object with a frequency of access below the threshold. ### Claim 8 In a computer system comprised of a memory repository in which is stored a set of tables and a processor communicatively coupled to the memory repository and thereby to the stored set of tables, a computer-implemented method for determining frequencies for updating dependency information among the stored set of tables, the method comprising: providing a set of flattened tables stored in a memory repository in a computer system, each flattened table in the set of flattened tables including table data and table meta-data converted from a compact table collected from a corpus of documents, the set of flattened tables organized to be searchable by schema-less queries; determining a plurality of dependent objects in the set of flattened tables, wherein a dependent object comprises all or part of a flattened table in the set of flattened tables, and wherein the processor maintains and updates dependency information stored in the memory repository, the stored dependency information maps dependency between dependent objects in the plurality of dependent objects, and wherein a frequency of access is stored in memory for each dependent object in the plurality of dependent objects; determining a frequency of access for each of the plurality of dependent objects; and based on the frequency of access for each of the plurality of dependent objects determine a frequency of updating dependency information for the respective each of the plurality of dependent objects. ### Claim 9 (depends on 8) The method of claim 8, further comprising assigning a fixed number of update frequencies to the plurality of dependent objects. ### Claim 10 (depends on 8) The method of claim 8, wherein a frequency of updating dependency information for a dependent object is proportional to a frequency of access for the dependent object. ### Claim 11 (depends on 8) The method of claim 8, wherein a frequency of updating dependency information for dependent objects monotonically increases with a frequency of access for the dependent objects. ### Claim 12 (depends on 8) The method of claim 8, wherein a frequency of updating dependency information for a first dependent object with a frequency of access above a threshold is higher than a frequency of updating dependency information for a second dependent object with a frequency of access below the threshold. ### Claim 13 (depends on 8) The method of claim 8, further comprising: maintaining a first copy of said dependency information in persistent storage and maintaining a second copy of said dependency information in main memory. ### Claim 14 A non-transitory computer readable storage medium, comprising computer instructions which, responsive to being executed by a processor in a computer system comprised of a memory repository in which is stored a set of tables and the processor being communicatively coupled to the memory repository and thereby to the set of tables, cause the processor to perform a method for maintaining dependency information among the set of tables, the method comprising: providing a set of flattened tables stored in a memory repository in a computer system, each flattened table in the set of flattened tables including table data and table meta-data converted from a compact table collected from a corpus of documents, the set of flattened tables organized to be searchable by schema-less queries; determining a plurality of dependent objects in the set of flattened tables, wherein a dependent object comprises all or part of a flattened table in the set of flattened tables, and wherein the processor maintains and updates dependency information stored in the memory repository, the stored dependency information maps dependency between dependent objects in the plurality of dependent objects in the set of flattened tables thereby organized to be searchable by schema-less queries, and wherein a frequency of access is stored in memory for each dependent object in the plurality of dependent objects; determining a frequency of access for each of the plurality of dependent objects; and in response to an access frequency of a dependent object exceeding a threshold, maintaining and updating dependency information corresponding to the dependent object stored in the memory repository. ### Claim 15 (depends on 14) The non-transitory computer readable storage medium of claim 14, the method further comprising: ceasing to maintain dependency information for the dependent object in response to the access frequency for the dependent object falling below the threshold. ### Claim 16 (depends on 14) The non-transitory computer readable storage medium of claim 14, the method further comprising: maintaining a first copy of said dependency information in persistent storage and maintaining a second copy of said dependency information in main memory. ### Claim 17 (depends on 14) The non-transitory computer readable storage medium of claim 14, the method further comprising: using the frequency of access for each of the plurality of dependent objects to determine a frequency of updating dependency information for each of the plurality of dependent objects. ### Claim 18 (depends on 17) The non-transitory computer readable storage medium of claim 17, the method further comprising: assigning a fixed number of update frequencies to the plurality of dependent objects. ### Claim 19 (depends on 17) The computer readable storage medium of claim 17, wherein a frequency of updating dependency information for a dependent object is proportional to a frequency of access for the dependent object.