Keyword Search in Databases- P25 ppsx
... the keywords contained in the entry. Each keyword MBR for keyword w i is the minimum bounding rectangle that contains all w i in the entry. An example of an entry of the BR ∗ -Tree is shown in Figure ... references from tuples in U to tuples in V . 1. Finding keys in table U. In this step, a set of key attributes are discovered to be joined in table V . The algorithms deve...
Ngày tải lên: 06/07/2014, 00:20