Friday, 15 May 2015

algorithm - Find all the rows given the number of matching attributes and the query -


Below is my problem definition:

Looking at a database d, Are I looking at a query, which is a vector of standard attributes and the number of matches, k how to find all line IDs, such as the number of properties matched in the query is more or more efficiently?

The Easy Edition (I think) is that & lt; A vector of = m has been given -Certual attributes, how to find the AIDS of those rows; = Matches M-secretary attributes.

In some queries (for example), they need to scan the whole data in the query every time it comes in. I think it's not fast enough, I'm not really sure about the complexity on it.

If this is possible, then I want to avoid scanning all the rows in the database. Therefore, I am thinking of building some types of index, but I am thinking that there is no current work for them or not?

In addition, is it a similar problem and what is it called?

Thank you very much for your help.

(Regarding coding, I mainly use Python 2.7 for code 2).


No comments:

Post a Comment