Patentable/Patents/US-11960468
US-11960468

Late-binding database views

PublishedApril 16, 2024
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

A database management system receives a command defining a view of the database. The view definition is accepted without determining whether references to schema elements within the view definition are resolvable to existing elements of the database schema. A query of the view is received. In response to the query of the view, the database management system resolves references to schema elements in the view definition by determining whether the references correspond to data available for processing the query.

Patent Claims
16 claims

Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.

Claim 2

Original Legal Text

2. The system of claim 1, wherein the element of the database schema corresponds to data stored by a remote data storage service.

Plain English Translation

A system for managing database schemas includes a schema definition module that generates a schema for a database, where the schema includes elements representing data structures. The system also includes a data storage interface that interacts with a remote data storage service to store and retrieve data based on the schema. The schema elements correspond to data stored by the remote service, allowing the system to map database operations to remote storage operations. This enables efficient data management across distributed storage systems while maintaining schema consistency. The system may also include a schema validation module to ensure the schema adheres to predefined rules, and a query processor to execute queries against the schema. The remote data storage service may be a cloud-based service, providing scalable and flexible storage solutions. The system ensures that database operations are correctly translated to the remote service's API calls, optimizing performance and reliability. This approach simplifies integration with external storage systems while maintaining data integrity and accessibility.

Claim 3

Original Legal Text

3. The system of claim 1, wherein the element refers to data potentially stored in at least one of a semi-structured or unstructured collection of data.

Plain English Translation

The invention relates to a data processing system designed to handle and analyze data stored in semi-structured or unstructured formats. Semi-structured data lacks a rigid schema but contains some organizational properties, such as tags or metadata, while unstructured data, like text documents or images, has no predefined structure. The system is configured to extract, process, and interpret such data to derive meaningful insights or perform specific tasks. This capability is particularly useful in environments where data is diverse and not easily organized into traditional relational databases. The system may include components for data ingestion, parsing, and analysis, ensuring compatibility with various data sources. By accommodating semi-structured and unstructured data, the system enhances flexibility and adaptability in data-driven applications, such as natural language processing, document management, or big data analytics. The invention addresses the challenge of efficiently managing and utilizing data that does not conform to structured formats, enabling more comprehensive and accurate data processing in real-world scenarios.

Claim 4

Original Legal Text

4. The system of claim 3, wherein the at least one memory comprising further instructions that, in response to being executed by the at least one processor, cause the system at least to parse at least one of the semi-structured or unstructured collection of data to identify data corresponding to the element of the database schema.

Plain English Translation

The system is designed for processing and analyzing semi-structured or unstructured data collections to extract and map relevant information to a predefined database schema. The system includes at least one processor and memory storing instructions that, when executed, enable the system to parse the data collections to identify and extract data elements that correspond to specific elements of the database schema. This parsing process involves analyzing the structure and content of the data to determine which portions align with the schema's defined fields or categories. The system may employ techniques such as pattern recognition, natural language processing, or rule-based extraction to accurately identify and map the relevant data. The extracted data is then organized and stored in a structured format according to the database schema, facilitating efficient querying, analysis, and integration with other systems. This approach addresses the challenge of handling diverse, unstructured data sources by automating the extraction and structuring of meaningful information, reducing manual effort and improving data consistency. The system is particularly useful in applications requiring integration of disparate data sources into a unified database for analytics, reporting, or decision-making purposes.

Claim 5

Original Legal Text

5. The system of claim 1, wherein the at least one memory comprising further instructions that, in response to being executed by the at least one processor, cause the system at least to execute the query of a view based at least in part on an estimated cost of resolving unresolved references included in the definition.

Plain English Translation

This invention relates to database systems, specifically optimizing query execution in relational databases by evaluating the cost of resolving unresolved references in view definitions. The problem addressed is inefficient query performance when executing views that contain unresolved references, such as subqueries or external data sources, which can lead to unnecessary computational overhead and delays. The system includes a database management component that analyzes view definitions before execution. When a query is issued against a view, the system estimates the computational cost of resolving any unresolved references within the view's definition. These references may include dependencies on other tables, subqueries, or external data sources that are not immediately available or require additional processing. The system then uses this cost estimation to optimize query execution, potentially avoiding or deferring the resolution of high-cost references to improve performance. The cost estimation process considers factors such as the complexity of the unresolved references, the size of the data involved, and the availability of cached or precomputed results. By dynamically assessing these costs, the system can prioritize or skip certain reference resolutions based on the overall query requirements, leading to more efficient execution plans. This approach helps reduce unnecessary processing and improves the responsiveness of database queries involving complex views.

Claim 7

Original Legal Text

7. The method of claim 6, wherein the element of the database schema refers to a collection of data stored externally to the database.

Plain English Translation

This invention relates to database systems and specifically to managing database schemas that reference external data collections. The problem addressed is the inefficiency and complexity of handling database elements that depend on data stored outside the database itself, such as in external files, cloud storage, or other databases. Traditional systems often require manual updates or complex integration logic to maintain consistency between the database schema and external data sources, leading to errors and performance bottlenecks. The invention provides a method for managing a database schema where an element of the schema refers to a collection of data stored externally to the database. The method ensures that the database schema remains synchronized with the external data collection without requiring manual intervention. This is achieved by automatically detecting changes in the external data collection and updating the corresponding database schema element accordingly. The method may also include validating the external data against the schema's requirements before integration, ensuring data integrity. Additionally, the system can optimize performance by caching frequently accessed external data or pre-processing it to match the database's internal structure. The solution improves efficiency, reduces errors, and simplifies the management of hybrid database systems that rely on both internal and external data sources.

Claim 8

Original Legal Text

8. The method of claim 6, wherein the element refers to data potentially stored in at least one of a semi-structured or unstructured collection of data.

Plain English Translation

This invention relates to data processing systems that handle semi-structured or unstructured data collections. The problem addressed is efficiently managing and retrieving data that does not conform to rigid, predefined schemas, such as text documents, logs, or NoSQL databases, where traditional structured query methods are ineffective. The method involves processing an element, which represents a data item or query, by referencing data stored in semi-structured or unstructured collections. Semi-structured data may include formats like JSON or XML, where some organizational structure exists but is flexible, while unstructured data lacks any predefined schema, such as raw text or multimedia files. The method ensures compatibility with diverse data formats, allowing systems to extract, transform, or analyze information without requiring strict schema adherence. The process includes identifying the relevant data collection, determining the appropriate parsing or extraction technique based on the data's structure, and applying the necessary operations to retrieve or manipulate the data. This approach enables flexible querying and processing across heterogeneous data sources, improving interoperability and usability in environments where data lacks a uniform structure. The method supports dynamic schema inference, pattern matching, and context-aware extraction, enhancing accuracy and efficiency in handling unstructured or semi-structured data.

Claim 9

Original Legal Text

9. The method of claim 6, wherein the definition of the view is validated without determining whether schema elements referenced by the definition of the view correspond to defined elements of the database schema.

Plain English Translation

A method for validating a database view definition without verifying whether the referenced schema elements exist in the database schema. In database systems, views are virtual tables that present data from one or more underlying tables based on a defined query. A common challenge in managing views is ensuring their definitions remain valid, especially when the underlying database schema evolves. Traditional validation methods check whether all referenced tables, columns, and other schema elements exist in the database schema, which can be computationally expensive and disruptive to system performance. This method improves efficiency by validating the view definition without confirming the existence of referenced schema elements. Instead, it focuses on syntactic and structural correctness, such as checking the grammar of the view definition, ensuring proper joins, and verifying that referenced elements follow the expected naming conventions. By skipping the schema element existence check, the method reduces validation overhead and allows for faster, non-disruptive validation of view definitions. This approach is particularly useful in large-scale database environments where frequent schema changes occur, as it enables quick validation without requiring immediate access to the underlying schema metadata. The method can be applied during view creation, modification, or as part of a periodic validation process to maintain data integrity and system performance.

Claim 10

Original Legal Text

10. The method of claim 9, further comprising determining, each time the view is queried, whether schema elements referenced by the definition of the view correspond to defined elements of the database schema.

Plain English Translation

This invention relates to database systems, specifically methods for managing and validating database views. Database views are virtual tables that present data from one or more underlying tables, often with transformations or filters. A key challenge in database management is ensuring that views remain valid and functional, particularly when the underlying database schema changes. If a view references schema elements (such as tables, columns, or functions) that no longer exist or have been modified, the view may fail or produce incorrect results. The invention addresses this problem by introducing a validation step that checks the integrity of a view each time it is queried. When a view is queried, the system automatically verifies whether all schema elements referenced in the view's definition still exist and are correctly defined in the database schema. This ensures that the view remains consistent with the current database structure, preventing errors during execution. The validation process may involve parsing the view definition, identifying all referenced schema elements, and cross-referencing them with the current schema metadata. If discrepancies are found, the system may either reject the query, log an error, or attempt to resolve the issue automatically. This approach enhances reliability in database systems by proactively detecting and addressing schema inconsistencies before they impact query execution.

Claim 12

Original Legal Text

12. The method of claim 6, wherein validating the definition of the view comprises determining that the definition is syntactically valid without determining whether the definition comprises references to non-existent elements of the database schema.

Plain English Translation

A method for validating a database view definition focuses on ensuring the definition is syntactically correct without verifying whether it references non-existent elements in the database schema. This approach streamlines the validation process by checking only the structural integrity of the view definition, such as proper syntax, valid SQL constructs, and correct formatting, while ignoring the existence or accessibility of referenced tables, columns, or other schema elements. The method is particularly useful in environments where schema validation is performed separately or where partial validation is preferred for efficiency. By separating syntactic validation from schema reference validation, the method reduces unnecessary processing overhead and allows for faster feedback during view creation or modification. This technique is applicable in database management systems, data warehousing, and any system requiring view definitions to be validated before execution or deployment. The method ensures that syntactically invalid definitions are caught early, while deferring checks for referenced elements to a later stage or a separate validation process. This approach improves workflow efficiency and reduces the risk of errors in view definitions.

Claim 13

Original Legal Text

13. The method of claim 6, further comprising formulating a query plan based at least in part on a cost of resolving the reference to the element.

Plain English Translation

A method for optimizing query execution in database systems addresses the inefficiency of resolving references to elements, such as foreign keys or pointers, which can significantly impact performance. The method involves analyzing the cost associated with resolving these references during query processing. By evaluating the cost, the system determines the most efficient way to access the referenced data, whether through direct joins, subqueries, or other techniques. This cost-based approach ensures that the query plan is optimized for speed and resource utilization, reducing unnecessary data retrieval and processing overhead. The method integrates with existing query optimization frameworks, dynamically adjusting the query plan based on real-time cost assessments. This improves overall system performance, particularly in large-scale databases where reference resolution can be a bottleneck. The solution is applicable to relational databases, NoSQL systems, and other data storage architectures where efficient reference resolution is critical.

Claim 15

Original Legal Text

15. The non-transitory computer-readable storage medium of claim 14, wherein the element of the database schema refers to a collection of data stored externally to the database.

Plain English Translation

This invention relates to database systems, specifically improving data management by integrating external data sources into a database schema. The problem addressed is the inefficiency of traditional databases that require all data to be stored internally, leading to redundancy, increased storage costs, and difficulties in maintaining consistency when external data changes. The invention provides a non-transitory computer-readable storage medium containing instructions for a database system. The system includes a database schema with elements that can reference collections of data stored externally to the database. These external data collections may be located in other databases, cloud storage, or file systems. By allowing schema elements to reference external data, the system reduces storage redundancy, lowers costs, and ensures data consistency by directly accessing the latest external data when needed. The database system dynamically retrieves external data when queried, eliminating the need for manual updates or synchronization processes. This approach is particularly useful for large-scale databases where integrating external datasets would otherwise be cumbersome. The invention also includes mechanisms to validate and authenticate external data references, ensuring reliability and security. The system may further include metadata tracking the source, format, and access permissions of the external data, enabling efficient management and governance. This solution enhances flexibility, scalability, and performance in database operations by leveraging external data sources seamlessly.

Claim 16

Original Legal Text

16. The non-transitory computer-readable storage medium of claim 14, wherein the element refers to at least one of a structured or semi-structured collection of data.

Plain English Translation

A system and method for processing and analyzing data collections involves storing data in a structured or semi-structured format, such as databases, spreadsheets, or XML files, to facilitate efficient retrieval and manipulation. The system includes a data processing module that extracts, transforms, and loads data from various sources into a unified storage system. A query engine allows users to search and filter the data using predefined or custom criteria. The system also includes an analysis module that applies statistical, machine learning, or rule-based techniques to derive insights from the data. The results are presented through a user interface, which may include visualizations, reports, or interactive dashboards. The system is designed to handle large-scale data sets while ensuring data integrity and security. The structured or semi-structured format enables flexible querying and analysis, making it suitable for applications in business intelligence, scientific research, and data-driven decision-making. The invention improves data accessibility and usability by automating data processing workflows and providing tools for advanced analytics.

Claim 17

Original Legal Text

17. The non-transitory computer-readable storage medium of claim 14, wherein the instructions further comprise instructions that, as a result of being executed by the one or more processors, cause the computer system to validate the definition of the view without determining whether schema elements referenced by the definition of the view correspond to defined elements of the database schema.

Plain English Translation

This invention relates to database systems and specifically to validating view definitions in a database schema. The problem addressed is the inefficiency in traditional validation processes where a database system checks both the syntax of a view definition and whether all referenced schema elements (e.g., tables, columns) exist in the database schema. This can be computationally expensive, especially in large databases, and may not be necessary for certain validation purposes. The invention provides a method for validating a view definition in a database system without verifying the existence of referenced schema elements. The system receives a view definition, which includes a query or other logic that defines how data should be retrieved or presented. The validation process checks the syntax and structure of the view definition to ensure it is correctly formatted and logically consistent, but it does not verify whether the tables, columns, or other elements referenced in the view definition actually exist in the database schema. This approach reduces computational overhead by skipping unnecessary checks, allowing for faster validation when full schema consistency is not required. The method can be implemented in a computer system using one or more processors executing instructions stored on a non-transitory computer-readable storage medium. The system may also include a database schema that defines the structure of the database, including tables, columns, and other elements. The validation process operates independently of the database schema, focusing only on the view definition's internal consistency. This technique is particularly useful in scenarios where rapid validation is needed, such as during development or testing, or when the referenced elements are expe

Claim 18

Original Legal Text

18. The non-transitory computer-readable storage medium of claim 14, wherein the instructions further comprise instructions that, as a result of being executed by the one or more processors, cause the computer system to determine, each time the view is queried, whether schema elements referenced by the definition of the view correspond to existing elements of the database schema.

Plain English Translation

This invention relates to database management systems, specifically to techniques for validating database views against schema changes. The problem addressed is ensuring that database views remain consistent with the underlying database schema, as schema modifications (e.g., table or column deletions) can break view definitions, leading to errors when the views are queried. The invention provides a computer-implemented method for dynamically validating database views. When a view is queried, the system checks whether all schema elements (e.g., tables, columns) referenced in the view's definition still exist in the current database schema. If any referenced elements are missing or invalid, the system detects the inconsistency before executing the query, preventing runtime errors. This validation step occurs automatically each time the view is queried, ensuring real-time consistency between the view definition and the actual database schema. The solution involves a computer system executing instructions stored on a non-transitory storage medium. The system compares the view's definition against the current schema to verify that all referenced elements are valid. If discrepancies are found, the system may log an error or notify the user, allowing for proactive schema maintenance. This approach improves database reliability by catching schema-related view errors early, reducing downtime and debugging efforts. The method is particularly useful in environments where database schemas evolve frequently, such as in large-scale applications or collaborative development settings.

Claim 19

Original Legal Text

19. The non-transitory computer-readable storage medium of claim 14, wherein the instructions further comprise instructions that, as a result of being executed by the one or more processors, cause the computer system to resolve the reference to the element by at least retrieving a column of data corresponding to the element from a remote data store.

Plain English Translation

This invention relates to computer systems that process and resolve references to data elements in a database. The problem addressed is efficiently retrieving and resolving references to data elements stored in a remote data store, particularly when the elements are represented as columns in a structured data format. The invention involves a computer system executing instructions to resolve such references by retrieving the corresponding column of data from a remote data store. The system may also perform additional operations, such as analyzing the retrieved data to determine its structure or content, and using this information to further process or display the data. The remote data store may be a distributed or cloud-based storage system, and the retrieval process may involve network communication protocols to access the stored data. The invention aims to improve the efficiency and accuracy of data reference resolution in distributed computing environments by leveraging remote data storage and retrieval mechanisms. The system may also include features for handling errors or conflicts that arise during the retrieval process, such as retry mechanisms or fallback procedures. The overall goal is to provide a robust and scalable solution for managing and accessing data elements in a distributed computing environment.

Claim 20

Original Legal Text

20. The non-transitory computer-readable storage medium of claim 14, further comprising estimating a cost of resolving references to the element of the database schema.

Plain English Translation

A system and method for managing database schema references in software development involves analyzing a database schema to identify elements such as tables, columns, or relationships. The system detects references to these elements within application code, configuration files, or other artifacts, then evaluates the impact of modifying the referenced elements. This includes assessing compatibility risks, such as breaking changes, and estimating the cost of resolving these references. The cost estimation considers factors like the number of references, their locations, and the effort required to update them. The system may also prioritize modifications based on the estimated cost and impact, guiding developers in making schema changes with minimal disruption. This approach helps maintain database integrity while reducing the time and effort needed to manage schema evolution in large-scale applications.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

May 17, 2018

Publication Date

April 16, 2024

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, FAQs, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Late-binding database views” (US-11960468). https://patentable.app/patents/US-11960468

© 2026 Nomic Interactive Technology LLC. Machine-readable context available at /api/llm-context/US-11960468. See llms.txt for full attribution policy.