Efficient internet protocol prefix match support on No-SQL and/or non-relational databases
Abstract:
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.
Information query
Patent Agency Ranking
0/0