adplus-dvertising
frame-decoration

Question

How is efficient access by predicate achieved in HDT-FoQ?

a.

By using a separate dictionary for predicates

b.

By loading Sp as a wavelet tree

c.

By implementing a full scan of Sp

d.

By using a separate data structure for each predicate

Posted under Big Data Computing

Answer: (b).By loading Sp as a wavelet tree Explanation:In HDT-FoQ, efficient access by predicate is achieved by loading Sp (the predicate sequence) as a wavelet tree.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How is efficient access by predicate achieved in HDT-FoQ?