Database Paper Browser

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
10368
Venue
VLDB
Year
2012
Pagerank
4.8925595e-05
Overall Rank
6,919 | 51.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,455 Natural Language Data Management and Interfaces: Recent Development and Open Challenges 2017 SIGMOD 5.4977219e-05
11,755 Scalable Semantic Querying of Text 2018 VLDB 4.1945683e-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