Full text index structure (B tree?)
Posted by:
Nash P
Date: June 14, 2010 05:51AM
Hi,
I have read about full text index structure being a B-tree with 2 levels. I intend to know the exact structure of this. Here are a few questions I want to address.
1) since its for full text search there needs to be a keyword - inverted list link. How is it handled in mysql indexing? Is it like for a keyword (assuming keyword forms a node in B-tree) with multiple occurrences, we have a single node and its child is a list of docids in which it occurs?
Could anyone please give more information about this and the exact B-tree structure?
Thanks
Subject
Views
Written By
Posted
Full text index structure (B tree?)
6478
June 14, 2010 05:51AM
2887
June 14, 2010 06:16PM
Sorry, you can't reply to this topic. It has been closed.
Content reproduced on this site is the property of the respective copyright holders.
It is not reviewed in advance by Oracle and does not necessarily represent the opinion
of Oracle or any other party.