Browse Prior Art Database

SYSTEM AND METHOD FOR SCALABLE AND DYNAMIC CONTENT-BASED SEARCH WITHIN A DATABASE

IP.com Disclosure Number: IPCOM000243775D
Publication Date: 2015-Oct-16
Document File: 9 page(s) / 237K

Publishing Venue

The IP.com Prior Art Database

Abstract

SYSTEM AND METHOD FOR SCALABLE AND DYNAMIC CONTENT-BASED SEARCH WITHIN A DATABASE

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 40% of the total text.

Page 01 of 9

SYSTEM AND METHOD FOR SCALABLE AND DYNAMIC CONTENT -BASED SEARCH WITHIN A DATABASE

Abstract :

For a simple database search we need to know the name of the table as well as the column against which we are searching for a particular value. This idea is about eliminating the need of knowing the table structure and making the database engine capable of supporting a search query which does not limit itself to a single table or column. Through this algorithm, the database engine should be capable of parsing the user submitted input string and identify the scope, object and range of search within the database.

The algorithm receives the user-specified search query (with attributes and the information content to search). The algorithm uses an intelligent parser which parses the query to identify the multi-table search and the mode of search. It identifies the list of tables to which the user has select access, dynamically creates the queries based on the search mode and parallelizes the search through a master-slave process approach. Finally it displays the matching data (along with the dependent data if the user wants).

The novelty of the idea lies in:

1. It can dynamically create scalable SQLs and search for a given piece of data from multiple tables within a database. It does not require the user to know the table structure (name of table/columns) or the referential dependence within the tables.

2. It allows the user to specify the scope and mode of search through specific attributes within the query which can be parsed by the database engine according to its syntactical grammar.

Implementation details:

The application/user logs in to the database and submits a search with the key value. The query submitted will be something like:
Select * from ANY_TABLE where ANY_COLUMN =

(WITH DEPENDENT DATA?) (WITH LOOKUP TABLE?)

The query submitted by the user contains specific grammar/syntactical elements which help the database parser engine to identify the scope/mode of search. For example, when it sees the elements ANY_TABLE and ANY_COLUMN it knows it is a multi-table search. Also, WITH DEPENDENT DATA clause might mean the search results need to include rows which have a referential integrity dependence on the passed value. Similarly, WITH LOOKUP TABLE means the search engine is free to use the look-up table which is cached with values and indexes. The query will also support wild-card metacharacter based search.

After the database engine receives the query, it parses the query string to identify the specific attributes of search. Based on the attributes, it decides on which parser modules to use and how to create the dynamic SQL.

1


Page 02 of 9

It checks the table list, finds out the tables to which the user has select access and displays the data. It also looks for dependencies and displays the dependent data if the user has specified that in the attribute. Throughout the process, the search is parallelized by breaking it down into slave proc...