Supporting efficient parametric search of E-commerce data: A loosely-coupled solution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2287, Issue , 2002, Pages 409-429

  Wang, Min ^a   Chang, Yuan Chi ^a   Padmanabhan, Sriram ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; DATA HANDLING; DATABASE SYSTEMS; DIGITAL STORAGE; ELECTRONIC COMMERCE; QUERY LANGUAGES; QUERY PROCESSING;

APPLICATION AREA; E-COMMERCE SITES; E-COMMERCE SYSTEMS; ELECTRONIC PRODUCT; LOOSELY COUPLED; SEARCH CAPABILITIES; SEARCH PERFORMANCE; TIGHTLY-COUPLED;

SEARCH ENGINES;

EID: 33845497489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Aboulnaga and S. Chaudhuri. Self-tuning histograms: Building histograms without looking at data. In A. Delis, C. Faloutsos, and S. Ghandeharizadeh, editors, SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1-3, 1999, Philadephia, Pennsylvania, USA, pages 181–192. ACM Press, 1999.
2. R. Agrawal, T. Imielinsk, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993A CM SIGMOD International Conference on Management of Data, pages 207–216, 1993.
3. R. Agrawal, A. Somani, and Y. Xu. Storage and querying of e-commerce data. In VLDB’01, Proceedings of 27rd International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy. Morgan Kaufmann, 2001.
4. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 1994 International Conference on Very Large Databases, pages 487–499, 1994.
5. D. W.-L. Cheung, J. Han, V. Ng, and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In S. Y. W. Su, editor, Proceedings of the Twelfth International Conference on Data Engineering, February 26 - March 1, 1996, New Orleans, Louisiana, USA, pages 106–114. IEEE Computer Society, 1996.
6. G. P. Copeland and S. Khoshafian. A decomposition storage model. In S. B. Navathe, editor, Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 28-31, 1985, pages 268–279. ACM Press, 1985.
7. H. Garcia-Molina, J. Ullman, and J. Widom. Database System Implementation. Prentice-Hall, 2000.
8. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA, volume 29, pages 1–12. ACM, 2000.
9. H. V. Jagadish, H. Jin, B. C. Ooi, and K.-L. Tan. Global optimization of histograms. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, May 21-24, 2001, Santa Barbara, CA, USA, pages 223–234, 2001.
10. S. Khoshafian, G. P. Copeland, T. Jagodis, H. Boral, and P. Valduriez. A query processing strategy for the decomposed storage model. In Proceedings of the Third International Conference on Data Engineering, February 3-5, 1987, Los Angeles, California, USA, pages 636–643. IEEE Computer Society, 1987.
11. Y. Matias, J. S. Vitter, and M. Wang. Wavelet-based histograms for selectivity estimation. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 448–459, Seattle, WA, June 1998.
12. M. Muralikrishna and D. J. DeWitt. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, pages 28–36, 1988.
13. G. Piatetsky-Shapiro and C. Connell. Accurate estimation of the number of tuples satisfying a condition. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pages 256–276, 1984.
14. V. Poosala and Y. E. Ioannidis. Selectivity estimation without the attribute value independence assumption. In Proceedings of the 1997 International Conference on Very Large Databases, Athens, Greece, August 1997.
15. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. Shekita. Improved histograms for selectivity estimation of range predicates. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Canada, May 1996.
16. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, pages 23–34, 1979.
17. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In H. V. Jagadish and I. S. Mumick, editors, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, June 4-6, 1996, pages 1–12. ACM Press, 1996.
18. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules in large databases. In KDD 1997, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, August 14-17, 1997, Newport Beach, California, USA, pages 263–266. AAAI Press, 1997.
19. K. Wang, Y. He, and J. Han. Mining frequent itemsets using support constraints. In A. E. Abbadi, M. L. Brodie, S. Chakravarthy, U. Dayal, N. Kamel, G. Schlageter, and K.-Y. Whang, editors, VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, pages 43–52. Morgan Kaufmann, 2000.