CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
1 research outputs found
A note on the size of query trees
Author
Vardi Shai
Publication venue
Publication date
01/08/2017
Field of study
Full text link
We consider query trees of graphs with degree bounded by a constant,
d
d
d
. We give simple proofs that the size of a query tree is constant in expectation and
2
O
(
d
)
log
n
2^{O(d)}\log{n}
2
O
(
d
)
lo
g
n
w.h.p
arXiv.org e-Print Archive