Top-K Aggregation Queries over Large Networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale net...
Saved in:
Main Authors: | Yan, Xifeng, He, Bin, ZHU, Feida, Han, Jiawei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/508 https://ink.library.smu.edu.sg/context/sis_research/article/1507/viewcontent/ZhuFDicde10_aggregation.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining Top-K Large Structural Patterns in a Massive Network
by: ZHU, Feida, et al.
Published: (2011) -
Efficient Processing of Exact Top-k Queries over Disk-Resident Sorted Lists
by: PANG, Hwee Hwa, et al.
Published: (2010) -
gApprox: Mining Frequent Approximate Patterns from a Massive Network
by: CHEN, Chen, et al.
Published: (2007) -
Continuous Monitoring of Top-K Queries over Sliding Windows
by: MOURATIDIS, Kyriakos, et al.
Published: (2007) -
Efficient Topological OLAP on Information Networks
by: QU, Qiang, et al.
Published: (2011)