Object-Based Database Search Indexing and Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Table-based database systems are inefficient for logging changes and security access management, as they waste storage space by duplicating rows upon data modification and do not adapt well to security models, while object-based systems offer better security and logging but are less efficient for searching.
Innovation Solution
An object-based database system with a search index and weighted return path methods is implemented, allowing efficient logging and security access by storing data as a network of objects and using a search index to guide searches from matching objects to higher-level objects, while enforcing security policies and maintaining an effective state.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If table-based data structures are used, then searching the entire database is efficient, but storage space is wasted by duplicating rows when data is modified
Solution Approach 1:
The patent segments the database into multiple tables with specific purposes: a data table storing unique record values, a log table tracking modifications, and a search table enabling efficient queries. This segmentation allows each table to serve its function optimally without duplicating all data across multiple rows, thus reducing storage waste while maintaining search efficiency.
2Productivity
If table-based data structures are used, then searching is efficient, but security access management is difficult
Solution Approach 1:
The patent segments security management into separate components: user definitions stored in the data table, security policies stored in the policy table, and access logs stored in the log table. This allows security rules to be enforced at the table level without requiring complex row-based access control, making the system adaptable to security models while maintaining search efficiency.
3Reliability
If object-based database is used, then security access and logging are improved, but searching becomes less efficient
Solution Approach 1:
The patent introduces a search table as an intermediary structure that maintains indexes of data table contents. This search table acts as a mediator between the object-based data storage and search operations, enabling efficient searching without requiring traversal of the entire object network, thus resolving the efficiency problem while maintaining the security and logging benefits of object-based storage.
4Productivity
If object-based database is used, then logging of data modifications is efficient, but searching distributed data is complex
Solution Approach 1:
The patent segments the system into distinct components: object-based data tables for efficient logging, separate search tables for simplified querying, and log tables for modification tracking. This segmentation allows each component to optimize for its specific function, making logging efficient through object-based storage while keeping searching simple through indexed table structures.
Data Source
AI summary
Searching in an object-based database system is disclosed. Searching includes identifying one or more matching objects matching one or more terms of a search request in a search index and executing one or more return path methods associated with each of the one or more matching objects. Each of the one or more return path methods traverses an object tree and returns a parent object. The parent object is added to a list of search result parent objects. Searching further includes ranking the list of search result parent objects according to a ranking function and providing the ranked list of search result parent objects.