Top-K aggregation queries over large networks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 377-380

  Yan, Xifeng ^a   He, Bin ^b   Zhu, Feida ^c   Han, Jiawei ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION OPERATION; AGGREGATION QUERIES; APPLICATION DOMAINS; ATTRIBUTE VALUES; BIOLOGICAL PATHWAYS; EDGE TRAVERSAL; EMPIRICAL RESULTS; FUNCTIONAL ASSOCIATIONS; IN-NETWORK; LARGE GRAPHS; LARGE NETWORKS; LARGE-SCALE NETWORK; NEIGHBORING NODES; PARTIAL DISTRIBUTIONS; PERSONALIZED RECOMMENDATION; PRUNING TECHNIQUES; RELATIONAL DATABASE; SOCIAL NETWORKS;

AGGREGATES;

EID: 77952765716     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447863     Document Type: Conference Paper

References (18)

1. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proc. 7th Int. Conf. on World Wide Web (WWW'98), pages 107-117, 1998.
2. M. Carey and D. Kossmann. On saying "enough already!" in SQL. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 219-230, 1997.
3. S. Chaudhuri. Evaluating top-k selection queries. In VLDB, pages 397-410, 1999.
4. P. Domingos and M. Richardson. Mining the network value of customers. In Proc. 2001 ACM Int. Conf. on Knowledge Discovery in Databases (KDD'01), pages 57-66, 2001.
5. B. Hall, A. Jaffe, and M. Trajtenberg. The NBER patent citation data file: Lessons, insights and methodological tools. NBER Working Papers 8498, National Bureau of Economic Research, Inc, 2001.
6. V. Hristidis, N. Koudas, Y. Papakonstantinou, and L. Ca. Prefer: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD, pages 259-270, 2001.
7. I. Ilyas, W. Aref, and A. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754-765, 2003.
8. I. Ilyas, R. Shah, W. Aref, J. Vitter, and A. Elmagarmid. Rank-aware query optimization. In SIGMOD, pages 203-214, 2004.
9. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In Proc. 2003 ACM Int. Conf. on Knowledge Discovery in Databases (KDD'03), pages 137-146, 2003.
10. C. Li, K. C.-C. Chang, I. Ilyas, and S. Song. Ranksql: Query algebra and optimization for relational top-k queries. In SIGMOD, pages 131-142. ACM Press, 2005.
11. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. of the 12th Int. Conf. on Information and Knowledge Management (CIKM'03), pages 556-559, 2003.
12. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proc. 2008 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'08), pages 419-432, 2008.
13. J. Neville and D. Jensen. Iterative classification in relational data. In Proc. of the Workshop on Statistical Relational Learning, 17th National Conf. on Artificial Intelligence, page 4249, 2000.
14. M. Newman. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci., 98:404-409, 2001.
15. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In Proc. 2008 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'08), pages 567-580, 2008.
16. P. Tsaparas, N. Koudas, and T. Palpanas. Ranked join indices. In ICDE, pages 277-288, 2003.
17. A. Wu, M. Garland, and J. Han. Mining scale-free networks using geodesic clustering. In Proc. 2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'04), pages 719-724, 2004.
18. K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In ICDE, pages 189-200, 2003.