Generalized keyword matching for keyword based searching over relational databases

摘要: Searching by keywords and providing generalized matching capabilities on a relational database is enabled performing preprocessing operations to construct inverted list lookup tables based data record components at an interim level of granularity, such as column location. Prefix information in the stored for each keyword, keyword sub-string, or stemmed version keyword. A search performed rather than determine locations The scanned identify prefix associated with term. Schema about used link form subgraphs that span keywords. Join are generated consisting columns containing query join retrieve rows contain prefixes retrieved ranked order relevance before being output. By tables, initially searching obtain targeted subset upon which SQL queries can be collect records, made efficient.