Log in
Log into community
Find answers from the community
View all posts
Related posts
Did this answer your question?
π
π
π
Powered by
Hall
Inactive
Updated 3 months ago
0
Follow
Graph index
Graph index
Inactive
0
Follow
J
Jack2020
2 years ago
Β·
my code looks liek this: for text in texts:
if self.find_matching_keyword(text, key_words_for_remove_unneeded_text):
dc = GPTListIndex.from_documents([Document(text)])
tree_index_list.append(dc)
tree_index_summary.append(str(text))
loop_time = time.time()
print("Loop time: {:.6f} seconds".format(loop_time - filter_time))
L
J
4 comments
Share
Open in Discord
L
Logan M
2 years ago
So your graph is a bunch of list indexes with a tree index on top?
J
Jack2020
2 years ago
yes...
J
Jack2020
2 years ago
does it help to chunk them into smaller ones?
L
Logan M
2 years ago
So, with a list index, it will check EVERY node in that list index. So if there are a lot of documents in there, it will take some time
Typically a list index is best for generating summaries. Maybe you'd have more luck using vector indexes instead?
Add a reply
Sign up and join the conversation on Discord
Join on Discord