LDAP Directory Indexing via Attribute Concatenation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
LDAP directory services are limited in handling complex search queries, such as the join operation, which requires multiple searches and is inefficient, especially in directories with thousands of entries, due to their design as special-purpose data stores.
Innovation Solution
Indexing the database by concatenating anticipated combinations of object attributes and adding these concatenated attributes as indexes, allowing for efficient execution of complex search operations like the join operation by searching for concatenated attributes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If LDAP directory services are used for special-purpose data storage, then information retrieval is optimized, but complex search operations like join require multiple searches and are inefficient
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing concatenated values of frequently queried attribute combinations during the indexing phase. This allows complex join operations to be executed efficiently by simply searching for pre-computed concatenated strings rather than performing multiple separate searches and combining results at runtime.
Solution Approach 2:
The patent merges multiple attribute values into a single concatenated string for indexing purposes. By combining attributes that are frequently searched together into one indexed field, the system enables efficient single-search retrieval of what would otherwise require multiple searches and complex result combination logic.
2Adaptability or versatility
If multiple searches are performed for join operations, then complex queries can be executed, but the time and complexity required for search queries increases significantly
Solution Approach 1:
The system performs preliminary computation of concatenated attribute values during indexing, so that complex join queries can be answered by simple string searches on pre-computed data, eliminating the need for multiple sequential searches and reducing query time significantly.
Solution Approach 2:
The patent creates a copied and transformed version of the original data by concatenating attributes into new indexed fields. This copied structure allows efficient querying of complex relationships without affecting the original data model or requiring modifications to the core LDAP directory structure.
3Ease of operation
If directories are designed as special-purpose data stores optimized for information retrieval, then lookup efficiency is improved, but handling of complex search operations becomes limited
Solution Approach 1:
The patent makes the directory service multi-functional by enabling it to handle both simple lookups and complex join operations efficiently. By pre-computing and indexing concatenated attribute combinations, the system gains the versatility to perform complex queries while maintaining the lookup efficiency that characterizes special-purpose directory services.
Solution Approach 2:
The patent combines multiple attributes into concatenated indexed fields, allowing the directory to efficiently handle complex search operations that involve multiple attributes. This merging approach maintains the simplicity and speed of traditional directory lookups while extending capability to handle complex queries.
Data Source
AI summary
A method for indexing a database of one or more objects having one or more attributes, includes determining which of said one or more attributes should receive concatenation, concatenating those of said one or more attributes that have been determined to receive concatenation, and indexing said database with those of said one or more attributes that have been concatenated.