DBScholar

Back to papers

Efficient Indexing and Querying over Syntactically Annotated Trees

Summary: Indexing over unique subtrees of syntactically parsed trees; root-split coding stores partial subtree structure to shrink index size. Experiments show 50-80% index-size reduction versus interval coding and an order-of-magnitude speedup for tree-pattern queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10556
Venue
VLDB
Year
2012
Pagerank
5.6029996e-05
Overall Rank
7,524 | 48.38%
DOI
10.14778/2350229.2350256

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{chubak_vldb12,
        title = {{Efficient Indexing and Querying over Syntactically Annotated Trees}},
        author = {Chubak, Pirooz and Rafiei, Davood},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {11},
        pages = {1316--1327},
        doi = {10.14778/2350229.2350256},
        url = {https://doi.org/10.14778/2350229.2350256},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,130 Natural Language Data Management and Interfaces: Recent Development and Open Challenges 2017 SIGMOD 6.354484e-05
11,961 Scalable Semantic Querying of Text 2018 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers