research-article

Region-based online promotion analysis

Authors:

Jiawei HanAuthors Info & Claims

EDBT '10: Proceedings of the 13th International Conference on Extending Database Technology

Pages 63 - 74

https://doi.org/10.1145/1739041.1739052

Published: 22 March 2010 Publication History

Abstract

This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most interesting regions for effective promotion of an object (e.g., a product or a person) given by user, where a region is defined over continuous ranged dimensions. In our problem context, the object can be promoted in a region when it is top-ranked in it. Such type of promotion queries involves an exponentially large search space and expensive aggregation operations. For efficient query processing, we study a fresh, principled framework called region-based promotion cube (RepCube). Grounded on a solid cost analysis, we first develop a partial materialization strategy to yield the provably maximum online pruning power given a storage budget. Then, cell relaxation is performed to further reduce the storage space while ensuring the effectiveness of pruning using a given bound. Extensive experiments conducted on large data sets show that our proposed method is highly practical, and its efficiency is one to two orders of magnitude higher than baseline solutions.

References

[1]

D. Burdick, P. M. Deshpande, T. S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. Olap over uncertain and imprecise data. VLDB J., 16(1):123--144, 2007.

Digital Library

[2]

S. Chaudhuri and U. Dayal. An overview of data warehousing and olap technology. SIGMOD Record, 26(1):65--74, 1997.

Digital Library

[3]

Y. Chen, G. Dong, J. Han, B. W. Wah, and J. Wang. Multi-dimensional regression analysis of time-series data streams. In VLDB, pages 323--334, 2002.

Digital Library

[4]

C. K. Chui, E. Lo, B. Kao, and W.-S. Ho. Supporting ranking pattern-based aggregate queries in sequence data cubes. In CIKM, pages 997--1006, 2009.

Digital Library

[5]

J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Min. Knowl. Discov., 1(1):29--53, 1997.

Digital Library

[6]

J. Han and M. Kamber, editors. Data mining: concepts and techniques, second edition. Morgan Kaufmann, 2006.

Digital Library

[7]

C.-T. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in olap data cubes. In In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, pages 73--88, 1997.

Digital Library

[8]

C. X. Lin, B. Ding, J. Han, F. Zhu, and B. Zhao. Text cube: Computing ir measures for multidimensional text database analysis. In ICDM, pages 905--910, 2008.

Digital Library

[9]

E. Lo, B. Kao, W.-S. Ho, S. D. Lee, C. K. Chui, and D. W. Cheung. Olap on sequence data. In SIGMOD Conference, pages 649--660, 2008.

Digital Library

[10]

R. Ramakrishnan and B.-C. Chen. Exploratory mining in cube space. Data Min. Knowl. Discov., 15(1):29--54, 2007.

Digital Library

[11]

Y. Sun, J. Han, P. Zhao, Z. Yin, H. Cheng, and T. Wu. Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In EDBT, pages 565--576, 2009.

Digital Library

[12]

A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag. Reverse top-k queries. In ICDE, 2010.

[13]

Q. Wan, R. C.-W. Wong, I. F. Ilyas, M. T. Özsu, and Y. Peng. Creating competitive products. PVLDB, 2(1):898--909, 2009.

Digital Library

[14]

T. Wu, D. Xin, and J. Han. Arcube: supporting ranking aggregate queries in partially materialized data cubes. In SIGMOD Conference, pages 79--92, 2008.

Digital Library

[15]

T. Wu, D. Xin, Q. Mei, and J. Han. Promotion analysis in multi-dimensional space. In VLDB, 2009.

Digital Library

[16]

D. Xin, J. Han, H. Cheng, and X. Li. Answering top-k queries with multi-dimensional selections: The ranking cube approach. In VLDB, pages 463--475, 2006.

Digital Library

Cited By

Valkanas GLappas TGunopulos D(2017)Mining Competitors from Large Unstructured DatasetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2017.270510129:9(1971-1984)Online publication date: 1-Sep-2017
https://doi.org/10.1109/TKDE.2017.2705101
Tang YCai YMamoulis N(2016)Maximizing a record's standing in a relation2016 IEEE 32nd International Conference on Data Engineering (ICDE)10.1109/ICDE.2016.7498409(1530-1531)Online publication date: May-2016
https://doi.org/10.1109/ICDE.2016.7498409
Islam MLiu C(2016)Know your customerThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0428-325:4(545-570)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s00778-016-0428-3
Show More Cited By

Index Terms

Region-based online promotion analysis
1. Information systems
  1. Information systems applications
    1. Data mining

Recommendations

The Study on Consumer Behavior of Online Shops
SAINT '10: Proceedings of the 2010 10th IEEE/IPSJ International Symposium on Applications and the Internet

B to C market in Japan has been expanding as developing ICT infrastructure. In order to expand online shop market, we research consumer behavior of online shops. From our research at five universities, although many students utilize online shop web site, ...
Note. Optimal Promotion Strategies: A Demand-Sided Characterization

We generalize Narasimhan's Narasimhan, Chakravarthi. 1988. Competitive promotional strategies. J. Bus.614 427-449. model of retail promotion to include multiple products and general demand functions. Doing so allows us to further characterize optimal ...
Findings---Retailer Promotion Pass-Through: A Measure, Its Magnitude, and Its Determinants

We use data on all manufacturer funding and promotion activity by a major U.S. retailer during a two-year period to compute promotion pass-through and assess its magnitude. Then, we estimate a two-tiered probit and lognormal regression model to study ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '10: Proceedings of the 13th International Conference on Extending Database Technology

March 2010

741 pages

ISBN:9781605589459

DOI:10.1145/1739041

Editors:
Ioana Manolescu
INRIA, France
,
Stefano Spaccapietra
EPFL, Switzerland
,
Jens Teubner
ETH Zurich, Switzerland
,
Masaru Kitsuregawa
Tokyo University, Japan
,
Alain Leger
Orange - France Telecom R&D, France
,
Felix Naumann
Hasso Plattner Institute, Germany
,
Anastasia Ailamaki
EPFL, Switzerland
,
Fatma Ozcan
IBM Almaden Research Center

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 March 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

EDBT/ICDT '10

EDBT/ICDT '10: EDBT/ICDT '10 joint conference

March 22 - 26, 2010

Lausanne, Switzerland

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
338
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Valkanas GLappas TGunopulos D(2017)Mining Competitors from Large Unstructured DatasetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2017.270510129:9(1971-1984)Online publication date: 1-Sep-2017
https://doi.org/10.1109/TKDE.2017.2705101
Tang YCai YMamoulis N(2016)Maximizing a record's standing in a relation2016 IEEE 32nd International Conference on Data Engineering (ICDE)10.1109/ICDE.2016.7498409(1530-1531)Online publication date: May-2016
https://doi.org/10.1109/ICDE.2016.7498409
Islam MLiu C(2016)Know your customerThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0428-325:4(545-570)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1007/s00778-016-0428-3
Wang CHan J(2015)Mining Latent Entity StructuresSynthesis Lectures on Data Mining and Knowledge Discovery10.2200/S00625ED1V01Y201502DMK0107:1(1-159)Online publication date: 31-Mar-2015
https://doi.org/10.2200/S00625ED1V01Y201502DMK010
Cai YTang YMamoulis N(2015)Maximizing a Record’s Standing in a RelationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2015.240732927:9(2401-2414)Online publication date: 1-Sep-2015
https://doi.org/10.1109/TKDE.2015.2407329
Ge SU LMamoulis NCheung D(2015)Dominance relationship analysis with budget constraintsKnowledge and Information Systems10.1007/s10115-013-0694-y42:2(409-440)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s10115-013-0694-y
Tao FBrova GHan JJi HWang CNorick BEl-Kishky ALiu JRen XSun YDyreson CLi FÖzsu M(2014)NewsNetExplorerProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2594537(1091-1094)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2594537
Gkorgkas OVlachou ADoulkeridis CNØrvåg K(2013)Discovering Influential Data Objects over TimeProceedings of the 13th International Symposium on Advances in Spatial and Temporal Databases - Volume 809810.5555/2960717.2960726(110-127)Online publication date: 21-Aug-2013
https://dl.acm.org/doi/10.5555/2960717.2960726
Gkorgkas OVlachou ADoulkeridis CNørvåg K(2013)Discovering Influential Data Objects over TimeAdvances in Spatial and Temporal Databases10.1007/978-3-642-40235-7_7(110-127)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40235-7_7
Arvanitis ADeligiannakis AVassiliou YChen XLebanon GWang HZaki M(2012)Efficient influence-based processing of market research queriesProceedings of the 21st ACM international conference on Information and knowledge management10.1145/2396761.2398420(1193-1202)Online publication date: 29-Oct-2012
https://dl.acm.org/doi/10.1145/2396761.2398420
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten