Efficient query processing on large graphs
Graphs provide a natural way to represent real-world objects and their relationships, and hence they are utilized to model concepts and data in various domains, such as social networks, the Web, biological informatics and spatial databases. In the big data era, most graphs are extremely large and gr...
Main Author: | Zhu, Diwen |
---|---|
Other Authors: | Xiao Xiaokui |
Format: | Thesis |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/61838 |
Similar Items
-
Design and implementation of a visual graph querying simulator
by: Thian, Benji Chan One.
Published: (2012) -
Efficient visualization of XML query results
by: Ng, Pamela Hui Min.
Published: (2009) -
Querying on spatio-temporal databases and graphs
by: Chen, Yue
Published: (2022) -
Efficient evaluation of frequently issued similar XPath queries
by: Ong, Chin Sin.
Published: (2009) -
Efficient index structures for reachability and shortest path queries
by: Wang, Sibo
Published: (2016)