Common NP ENUM Data Locator Structure for Database Lookup Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current number portability (NP) and E.164 number (ENUM) databases face increasing lookup times and storage requirements as subscriber numbers grow, with duplicate data storage and inefficient binary tree data structures exacerbating these issues, and complex peering agreements hinder VoIP call routing.
Innovation Solution
Implementing a common NP/ENUM data locator structure that allows for unified access to both NP and ENUM data, using a hierarchical database system and peering agreement database to efficiently route network traffic and reduce duplicate data storage, while optimizing data retrieval through a series of linked tables and pointers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional binary tree data structures are used for NP and ENUM databases, then data can be organized and accessed, but lookup time increases and storage requirements increase as the number of subscribers increases
Solution Approach 1:
The patent segments the database into multiple distributed database servers rather than using a single centralized binary tree structure. Each server handles a portion of the data, allowing parallel access and reducing the time required to locate specific entries. The segmentation is achieved through partitioning the telephone number space across multiple servers.
Solution Approach 2:
The patent introduces a new dimensional approach by using a hash-based routing mechanism that maps telephone numbers to specific database servers using modulo arithmetic. This adds a routing dimension that enables direct access to the appropriate server without traversing the entire binary tree structure, significantly reducing lookup time.
2Reliability
If conventional binary tree data structures are used for NP and ENUM databases, then data can be stored and accessed, but storage requirements increase as the number of subscribers increases
Solution Approach 1:
The patent segments the database into multiple distributed database servers, allowing storage capacity to be distributed across multiple physical or virtual machines. This enables horizontal scaling where storage requirements can be met by adding more servers rather than expanding a single binary tree structure, optimizing storage utilization.
Solution Approach 2:
The patent creates a universal database access architecture that can handle both NP and ENUM data types through the same distributed hash table mechanism. This multi-functional system eliminates the need for separate binary tree structures for different data types, reducing overall storage requirements through consolidation and shared infrastructure.
3Adaptability or versatility
If NP and ENUM databases are separately maintained with duplicate TN data, then each database can function independently, but storage efficiency decreases due to duplicate data
Solution Approach 1:
The patent merges NP and ENUM databases into a unified distributed database system where both data types coexist in the same infrastructure. The system maintains independence of function through separate query processing logic while eliminating duplicate telephone number data through shared storage, achieving both versatility and storage efficiency.
Solution Approach 2:
The patent implements a universal database platform that serves multiple functions - handling both NP lookups and ENUM translations through a single distributed hash table structure. This multi-functional approach allows the system to maintain independence for different query types while eliminating redundant data storage through centralized data management.
4Shape
If binary tree data structures are used, then data can be organized hierarchically, but sophisticated balancing algorithms are required and data recovery requires reloading the entire database
Solution Approach 1:
The patent uses hash functions to create direct mapping copies of telephone numbers to database locations, eliminating the need for hierarchical balancing algorithms. The hash-based approach provides direct access without requiring complex balancing operations, while maintaining organized data distribution across the database servers.
Solution Approach 2:
The patent replaces the mechanical binary tree balancing system with a mathematical hash-based addressing system. Instead of using complex balancing algorithms to maintain hierarchical structure, the system uses hash functions to directly compute storage locations, eliminating the need for balancing operations and simplifying the overall system complexity.
5Shape
If binary tree data structures are used, then data can be stored in a structured format, but the key size may be greater than the data size and recovery requires entire database reload
Solution Approach 1:
The patent implements distributed copies of data across multiple database servers using hash-based routing. This redundancy enables efficient data recovery by allowing retrieval from alternative servers if data is corrupted or lost, without requiring reload of the entire database. The copying mechanism provides fault tolerance while maintaining structured data access.
Solution Approach 2:
The patent enables selective recovery of individual data records or partitions without requiring entire database reload. The distributed architecture allows discarding or recovering specific data segments independently, improving recovery efficiency by limiting the scope of recovery operations to only the affected portions rather than the entire database.
Data Source
Figure 1A
Figure 1B
Figure 2
AI summary
According to one aspect, the subject matter described herein comprises methods, systems, and computer program products for accessing number portability (NP) and E.164 number (ENUM) data in a combined NP/ENUM database. One method includes receiving a query including a telephone number (TN). A common NP/ENUM data locator structure is accessed to locate a pointer corresponding to the TN. In response to the query being a NP query, the pointer is used to locate NP data, and the NP data is returned. In response to the query being an ENUM query, the pointer is used to locate at least one URI and returning at least one uniform resource locators (URIs).