NoSQL Database Schema for IP Prefix Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Non-relational and No-SQL databases face challenges in efficiently executing longest IP prefix match queries due to the need for multiple sequential database queries, which increases latency and limits their use in network environments.
Innovation Solution
The solution involves creating a database schema with multiple tables indexed based on portions of an IP prefix and mask length, allowing queries to be executed in parallel, with results returned in descending order to ensure the most specific prefix match is identified efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If multiple sequential database queries are executed to identify longest IP prefix match, then query completeness is improved, but latency increases
Solution Approach 1:
The patent segments the IP prefix matching problem by creating multiple database tables, each indexed on different portions of the IP prefix (e.g., first 16 bits, next 8 bits, etc.). This segmentation allows the system to break down a single complex sequential query into multiple independent parallel queries, each targeting a specific table with a specific index portion, thereby reducing overall latency while maintaining query completeness.
Solution Approach 2:
The patent introduces a new dimension to the database schema by creating multiple tables with different index configurations based on various portions of the IP prefix. Instead of using a single table with one indexing strategy, the system adds dimensional diversity by organizing data across multiple tables (e.g., table_0 through table_15), each optimized for different prefix segments, enabling parallel query execution.
2Measurement precision
If Radix tree data structure is used for IP prefix matching, then matching accuracy is improved, but device complexity increases
Solution Approach 1:
The patent creates simplified copies of the Radix tree concept by implementing multiple flat database tables, each representing a segment of the prefix hierarchy. Instead of implementing a complex in-memory Radix tree structure, the system creates tabular copies organized by prefix portions, where each table contains pre-indexed prefix segments. This copying approach maintains the hierarchical matching capability while using simpler database table structures that are easier to implement and maintain.
3Adaptability or versatility
If non-relational database is used for IP prefix storage, then adaptability is improved, but query efficiency deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-organizing IP prefix data into multiple tables with specific index configurations before queries are executed. Each table is pre-indexed on different portions of the IP prefix (e.g., first 16 bits, next 8 bits, mask length), so that when a longest prefix match query arrives, the system can immediately execute parallel queries against these pre-organized tables without needing to perform complex runtime data organization, thereby improving query efficiency while maintaining No-SQL flexibility.
Data Source
AI summary
Systems and methods for automatically executing an efficient longest internet protocol prefix match on non-relational and/or No-SQL databases, such as Cassandra. Clustering prefixes around common and/or standard prefix lengths ensures efficient use of Cassandra's underlying mechanisms and minimizes costly scan operations.