Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Semi-Indexing Semi-Structured Data in Tiny Space #62

Open
pbevin opened this issue Jul 19, 2017 · 0 comments
Open

Semi-Indexing Semi-Structured Data in Tiny Space #62

pbevin opened this issue Jul 19, 2017 · 0 comments

Comments

@pbevin
Copy link
Contributor

pbevin commented Jul 19, 2017

http://www.di.unipi.it/~ottavian/files/semi_index_cikm.pdf

Imagine you have a collection of large JSON or XML documents, and you want to run queries over them that just grab a small subset of the data. You don't want to fully parse each document for each query, so you should index the documents somehow, but they all have different tree structures, and it's not clear what an index would look like. This paper shows how to augment each document with a small amount of data that makes it very fast to search inside them.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant