Web 2.0 OLAP: From data cubes to tag clouds

Lecture Notes in Business Information Processing

Volumn 18 LNBIP, Issue , 2009, Pages 51-64

  Aouiche, Kamel ^a   Lemire, Daniel ^a   Godin, Robert ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Business intelligence; Data warehouse; OLAP; Social web; Tag cloud

Indexed keywords

CLOUDS; DATA WAREHOUSES;

BUSINESS INTELLIGENCE; DATA CUBE; DATA SOURCE; EXPERIMENTAL EVIDENCE; LAYOUT OPTIMIZATION; OLAP; RANGE TOP-K QUERY; SOCIAL NETWORKING; SOCIAL WEB; TAG CLOUD; VISUALIZATION TECHNIQUE; WEB 2.0;

WORLD WIDE WEB;

EID: 67249115125     PISSN: 18651348     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-01344-7_5     Document Type: Conference Paper

References (41)

1. Heer, J., Viégas, F.B., Wattenberg, M.: Voyagers and voyeurs: supporting asynchronous collaborative information visualization. In: CHI 2007, pp. 1029-1038 (2007)
2. Wattenberg, M., Kriss, J.: Designing for social data analysis. IEEE Transactions on Visualization and Computer Graphics 12(4), 549-557 (2006)
3. IBM: Many Eyes (2007), http://services.alphaworks.ibm.com/manyeyes/ (accessed 7-6-2007)
4. Swivel, Inc.: Swivel (2007), http://www.swivel.com (accessed 7-6-2007)
5. Butler, D.: Data sharing: the next generation. Nature 446(7131), 1-10 (2007)
6. Codd, E.F.: Providing OLAP (on-line analytical processing) to user-analysis: an IT mandate. Technical report, E. F. Codd and Associates (1993)
7. Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In: ICDE 1996, pp. 152-159 (1996)
8. Body, M., Miquel, M., Bédard, Y., Tchounikine, A.: A multidimensional and multiversion structure for OLAP applications. In: DOLAP 2002, pp. 1-6 (2002)
9. Morzy, T., Wrembel, R.: On querying versions of multiversion data warehouse. In: DOLAP 2004, pp. 92-101 (2004)
10. Havenstein, H.: BI vendors seek to tap end-user power: New class of tools built to reap user knowledge for customizing analytic applications. InfoWorld 22, 20-21 (2003)
11. Viégas, F., Wattenberg, M., McKeon, M., van Ham, F., Kriss, J.: Harry potter and the meat-filled freezer: A case study of spontaneous usage of visualization tools. In: HICSS 2008, pp. 1-10 (2008)
12. Carey, M.J., Kossmann, D.: On saying "enough already!" in SQL. In: SIGMOD 1997, pp. 219-230 (1997)
13. Taylor, N.E., Ives, Z.G.: Reconciling while tolerating disagreement in collaborative data sharing. In: SIGMOD 2006, pp. 13-24. ACM, New York (2006)
14. Green, T.J., Karvounarakis, G., Taylor, N.E., Biton, O., Ives, Z.G., Tannen, V.: ORCHES-TRA: facilitating collaborative data sharing. In: SIGMOD 2007, pp. 1131-1133. ACM, New York (2007)
15. Wu, P., Sismanis, Y., Reinwald, B.: Towards keyword-driven analytical processing. In: SIG- MOD 2007, pp. 617-628 (2007)
16. Maniatis, A., Vassiliadis, P., Skiadopoulos, S., Vassiliou, Y., Mavrogonatos, G., Michalarias, I.: A presentation model & non-traditional visualization for OLAP. International Journal of Data Warehousing and Mining 1, 1-36 (2005)
17. Ben Messaoud, R., Boussaid, O., Loudcher Rabaséeda, S.: Efficient multidimensional data representations based on multiple correspondence analysis. In: KDD 2006, pp. 662-667 (2006)
18. Techapichetvanich, K., Datta, A.: Interactive visualization for OLAP. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3482, pp. 206-214. Springer, Heidelberg (2005)
19. Kaser, O., Lemire, D.: Tag-cloud drawing: Algorithms for cloud visualization. In: WWW 2007 - Tagging and Metadata for Social Information Organization (2007)
20. Hassan-Montero, Y., Herrero-Solana, V.: Improving tag-clouds as visual information retrieval interfaces. In: InSciT 2006 (2006)
21. Millen, D.R., Feinberg, J., Kerr, B.: Dogear: Social bookmarking in the enterprise. In: CHI 2006, pp. 111-120 (2006)
22. Russell, T.: Cloudalicious: folksonomy over time. In: JCDL, p. 364 (2006)
23. Jaffe, A., Naaman, M., Tassa, T., Davis, M.: Generating summaries and visualization for large collections of geo-referenced photographs. In: MIR 2006, pp. 89-98 (2006)
24. Rivadeneira, A.W., Gruen, D.M., Muller, M.J., Millen, D.R.: Getting our head in the clouds: toward evaluation studies of tagclouds. In: CHI 2007, pp. 995-998 (2007)
25. Chen, Q., Dayal, U., Hsu,M.: OLAP-based data mining for business intelligence applications in telecommunications and e-commerce. In: Bhalla, S. (ed.) DNIS 2000. LNCS, vol. 1966, pp. 1-19. Springer, Heidelberg (2000)
26. Cormode, G., Muthukrishnan, S.: What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249-278 (2005)
27. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996, pp. 20-29 (1996)
28. Chazelle, B.: A functional approach to data structures and its use inmultidimensional searching. SIAM J. Comput. 17(3), 427-462 (1988)
29. Poon, C.K.: Dynamic orthogonal range queries in OLAP. Theoretical Computer Science 296(3), 487-510 (2003)
30. Luo, Z.W., Ling, T.W., Ang, C.H., Lee, S.Y., Cui, B.: Range top/bottom k queries in OLAP sparse data cubes. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 678-687. Springer, Heidelberg (2001)
31. Loh, Z.X., Ling, T.W., Ang, C.H., Lee, S.Y.: Adaptive method for range top-k queries in OLAP data cubes. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 648-657. Springer, Heidelberg (2002)
32. Loh, Z.X., Ling, T.W., Ang, C.H., Lee, S.Y.: Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes. In: CIKM 2002, pp. 60-67 (2002)
33. Chung, Y.D., Yang, W.S., Kim, M.H.: An eficient, robust method for processing of partial top-k/bottom-k queries using the RD-tree in OLAP. Decision Support Systems 43(2), 313-321 (2007)
34. Seokjin, H., Moon, B., Sukho, L.: Efficient execution of range top-k queries in aggregate r-trees. IEICE - Transactions on Information and Systems E88-D (11), 2544-2554 (2005)
35. Donjerkovic, D., Ramakrishnan, R.: Probabilistic optimization of top n queries. In: VLDB 1999, pp. 411-422 (1999)
36. Feige, U., Lee, J.R.: An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1), 26-29 (2007)
37. Bhasker, J., Sahni, S.: Optimal linear arrangement of circuit components. J. VLSI Comp. Syst. 2(1), 87-109 (1987)
38. Johnson, D., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: VLDB 2004, pp. 13-23 (2004)
39. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335-379 (1976)
40. Hettich, S., Bay, S.D.: The UCI KDD archive (2000), http://kdd.ics.uci. edu (checked 2008-04-28)
41. O'Neil, P., Quass, D.: Improved query performance with variant indexes. In: SIGMOD 1997, pp. 38-49 (1997)