Back to Results
First PageMeta Content
Applied mathematics / Graph theory / Reachability / Directed acyclic graph / Connected component / SL / Graph / Graph connectivity / Theoretical computer science / Mathematics


Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets Houtan Shirani-Mehr Computer Science Dept. Univ. of Southern California
Add to Reading List

Document Date: 2012-05-08 17:15:55


Open Document

File Size: 1,48 MB

Share Result on Facebook

City

San Francisco / Beijing / /

/

Facility

store HN / /

IndustryTerm

contact networks / online query processing approaches / positioning devices / road network / query processing / query processing approach / delay-tolerant networks / reachability query processing approaches / input contact network / then query processing step / graph reachability algorithms / trajectory processing / redundant processing / latter graph contact network / time varying networks / external graphs traversal algorithms / given contact network / query processing progress / reachability query processing algorithms / reachability query processing / constructed contact network / large disk-resident contact networks / contact network / reachability query processing techniques / basic contact network / spatiotemporal networks / online processing phase / early query processing termination / online processing step / focusing on indexing a contact network / on indexing a contact network / existing reachability query processing techniques / /

OperatingSystem

Windows 7 / /

Organization

V NR / Univ. of Southern California / /

Person

Cyrus Shahabi / /

/

Position

RT / head / CPA / /

ProvinceOrState

Southern California / /

Region

Southern California / /

Technology

traversal algorithm / external graphs traversal algorithms / GPS / random access / mobile devices / existing graph reachability algorithms / existing reachability query processing algorithms / Bluetooth / Bluetooth protocol / DSRC protocol / /

SocialTag