Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Developing a Dynamic Materialized View Index for Efficiently Discovering Usable Views for Progressive Queries

  • Zhu, Chao (Dept. of Computer and Information Science, the University of Michigan) ;
  • Zhu, Qiang (Dept. of Computer and Information Science, the University of Michigan) ;
  • Zuzarte, Calisto (IBM Canada Software Lab) ;
  • Ma, Wenbin (IBM Canada Software Lab)
  • Received : 2013.02.26
  • Accepted : 2013.09.03
  • Published : 2013.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.

Keywords

References

  1. S. Agrawal, S. Chaudhuri and V. Narasayya, "Automated selection of materialized views and indexes in SQL databases." Proc.of VLDB Conf., 2000, pp. 391-398.
  2. K. Aouiche, and J. Darmont, "Data mining-based materialized view and index selection in data warehouses." J. Intell. Inf. Syst., vol.33, no. 1, 2009, pp. 65-93. https://doi.org/10.1007/s10844-009-0080-0
  3. L. Bellatreche, K. Karlapalem and Q. Li, "Evaluation of Materialized View Indexing in Data Warehousing Environments." Proc.of DaWaK Conf., 2000, pp. 57-66.
  4. S. Berchtold, D. A. Keim and H. Kriegel, "The X-tree: An Index Structure for High Dimensional Data." Proc.of VLDB Conf., 1996, pp. 28-39.
  5. D. Calvanese, G. D. Giacomo, M. Lenserini and M. Y. Vardi, "View-based query process: on the relationship between rewriting, answering and losslessness." Theor.Comput.Sci., vol.371, no. 3, 2007, pp. 169-182. https://doi.org/10.1016/j.tcs.2006.11.006
  6. K. Chakrabarti and S. Mehrotra, "The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces." Proc.of ICDE Conf., 1999, pp. 440-447.
  7. C. Y. Chan, M. N. Garofalakis and R. Rastogi, "RE-Tree: An Efficient Index Structure for Regular Expressions." Proc.of VLDB Conf., 2002, pp. 263-274.
  8. C. Y. Chan and Y. E. Ioannidis, "Bitmap Index Design and Evaluation." Proc.of SIGMOD Conf., 1998, pp. 355-366.
  9. D. Comer, "The ubiquitous B-tree." ACM Computing Survey, vol.11, no.2, 1979, pp. 121-137. https://doi.org/10.1145/356770.356776
  10. F. Fusco, M. Vlachos and M. Stoecklin, "Real-time creation of bitmap indexes on streaming network data." The VLDB Journal, vol. 21, no. 3,2012, pp. 287-307. https://doi.org/10.1007/s00778-011-0242-x
  11. G. Gou, M. Kormilitsin and R. Chirkova, "Query evaluation using overlapping views: completeness and efficiency." Proc.of SIGMOD Conf., 2006, pp. 37-48.
  12. G. Graefe, and M. J. Zwilling, "Transaction support for indexed views." Proc.of SIGMOD Conf., 2004.
  13. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching." Proc.of SIGMOND Conf., 1984, pp. 47-57.
  14. A. Y. Halevy, "Answering queries using views: a survey." The VLDB Journal, vol.10, no. 4, 2001, pp. 270-294. https://doi.org/10.1007/s007780100054
  15. H. He and A. K. Singh, "Closure-Tree: An Index Structure for Graph Queries." Proc.of ICDE Conf., 2006, pp. 38.
  16. B. He, H. Hsiao, Z. Liu, Y. Huang and Y. Chen, "Efficient Iceberg Query Evaluation Using Compressed Bitmap Index." IEEE Trans. Knowl. Data Eng., vol. 24, no. 9, 2012, pp. 1570-1583. https://doi.org/10.1109/TKDE.2011.73
  17. G. Himanshu, and I. S. Mumick, "Selection of Views to Materialize in a Data Warehouse." IEEE Transaction on Knowledge and Data Engineering, vol. 17, no. 1, 2005, pp. 24-43. https://doi.org/10.1109/TKDE.2005.16
  18. H. Jiang, H. Lu, W. Wang and B. C. Ooi, "XR-Tree: Indexing XML Data for Efficient Structural Joins." Proc.of ICDE Conf., 2003, pp. 253-264.
  19. N. Katayama and S. Satoh: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. Proc.of SIGMOND Conf., 1997, pp. 369-380.
  20. H. Kimura, G. Huo, A. Rasin, S. Madden and S. B. Zdonik, "CORADD: Correlation Aware Database Designer for Materialized Views and Indexes." PVLDB, vol. 3, no. 1, 2010, pp. 1103-1113.
  21. H. Kuno, A. and G. Graefe, "Deferred Maintenance of Indexes and of Materialized Views." Proc. of DNIS Conf., 2011, pp. 312-323.
  22. T. W. Kuo, C. H. Wei and K. Lam, "Real-Time Data Access Control on B-Tree Index Structures." Proc.of ICDE Conf., 1999, pp. 458-467.
  23. P.-A. Larson and H. Z. Yang, "Computing queries from derived relations." Proc. of VLDB Conf., 1985, pp. 259-269.
  24. P.-A. Larson and J. Zhou, "View matching for outer-join views." VLDB Journal, 2007, pp. 29-53.
  25. W. Lehner, R. J. Cochrane, H. Pirahesh and M. Zaharioudakis, "Fast Refesh using Mass Query Optimization." Proc.of ICDE Conf., 2001, pp. 391-398, 2001.
  26. Z. Liu and Y. Chen, "Answering Keyword Queries on XML Using Materialized Views." Proc. of ICDE Conf., 2008, pp. 1501-1503.
  27. I. Nitsos, G. Evangelidis and D. Dervos, "Bitmap-Tree Indexing for Set Operations on Free Text." Proc.of ICDE Conf., 2004, pp. 837.
  28. C.-S. Park, M.-H. Kim and Y.-J. Lee, "Rewriting OLAP Queries Using Materialized Views and Di mension Hierarchies in Data Warehouses." Proc. of ICDE Conf., 2001, pp. 515-523.
  29. R. Pottinger and A. Levy, "A Scalable Algorithm for Answering Queries Using Views." Proc. of VLDB Conf., 2000, pp. 484-495.
  30. J.T. Robinson, "The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes." Proc. of SIGMOND Conf., 1981, pp. 10-18.
  31. N. Roussopoulos, "View indexing in relational databases." ACM Trans. on Database Systems, vol.7, no.2, 1982, pp. 258-290. https://doi.org/10.1145/319702.319729
  32. P. Roy, S. Sudarshan and K. Ramamrithaml, "Materialized View Selection and Maintenance Using MultiQuery Optimization Hoshi Mistry." Proc. of SIGMOD Conf., 2001, pp. 307-318.
  33. M. Sadoghi and H. A. Jacobsen, "BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space." Proc.of SIGMOND Conf., 2011, pp. 637-648.
  34. Y. Sakurai, M. Yoshikawa, S. Uemura and H. Kojima, "The A-tree: An Index Structure for High- Dimensional Spaces Using Relative Approximation." Proc.of VLDB Conf., 2000, pp. 516-526.
  35. R. R. Sinha, M. Winslett, K. Wu, K. Stockinger and A. Shoshani, "Adaptive Bitmap Indexes for Space-Constrained Systems. Proc.of ICDE Conf., 2008, pp. 1418-1420.
  36. H. H. Sinha and M. Winslett, "Multi-resolution bitmap indexes for scientific data." ACM Trans. Database Syst., vol. 32, no. 3, 2010, pp. 16, 2010.
  37. D. Srivastava, S. Dar, H.V. Jagadish and A. Levy, "Answering Queries with Aggregation Using Views." Proc.of VLDB Conf., 1996, pp. 318-329.
  38. Z. A. Talebi, R. Chirkova, Y. Fathi and M. Stallmann, "Exact and inexact methods for selecting views and indexes for OLAP performance improvement." Proc. of EDBT Conf., 2008, pp. 311-322.
  39. W. Xu and Z. M. Ozsoyoglu, "Rewriting XPath Queries Using Materialized Views." Proc. of VLDB Conf., 2005, pp. 121-132.
  40. H. Wang, S. Park, W. Fan and P. S. Yu, "ViST: A Dynamic Index Method for Querying XML Data by Tree Structures." Proc.of SIGMOND Conf., 2003, pp. 110-121.
  41. H. Wang and X. Meng, "On the Sequencing of Tree Structures for XML Indexing." Proc.of ICDE Conf., 2005, pp. 372-383.
  42. K. Wu, A. Shoshani and K. Stockinger, "Analyses of multi-level and multi-component compressed bitmap indexes." ACM Trans. Database Syst., vol. 35, no. 1, 2010.
  43. Jong P. Yoon, "Presto Authorization: A Bitmap Indexing Scheme for High-Speed Access Control to XML Documents." IEEE Trans. Knowl. Data Eng., vol. 18, no. 7, 2006, pp. 971-987. https://doi.org/10.1109/TKDE.2006.113
  44. Z. Zhang, M. Hadjieleftheriou, B. C. Ooi and D. Srivastava, "Bed-tree: an all-purpose index structure for string similarity search based on edit distance." Proc.of SIGMOND Conf., 2010, pp. 915-926.
  45. C. Zhu, Q. Zhu and C. Zuzarte, "Efficient Processing of Monotonic Linear Progressive Queries via Dynamic Materialized Views." Proc.of CASCON Conf., 2010, pp. 224 -237.
  46. C. Zhu, Q. Zhu, C. Zuzarte and W. Ma, "A Materialized-View Based Technique to Optimize Progressive Queries via Dependency Analysis." Proc.of CASCON Conf., 2011, pp. 60-73.
  47. C. Zhu, Q. Zhu and C. Zuzarte, "Optimization of Monotonic Linear Progressive Queries Based on Dynamic Materialized Views." The Computer Journal, to appear, 2013.
  48. C. Zhu, Q. Zhu, C. Zuzarte and W. Ma: DMVI, "A Dynamic Materialized View Index for Efficiently Discovering Usable Views for Progressive Queries." Proc.of CASCON Conf., 2012, pp. 42-56.
  49. Q. Zhu, B. Medjahed, A. Sharma and H. Huang, "The Collective index: A Technique for Efficient Processing of Progressive Queries." The Computer Journal, vol. 51, no. 6, 2008, pp. 662-676. https://doi.org/10.1093/comjnl/bxm105

Cited by

  1. Grid-PPPS: A Skyline Method for Efficiently Handling Top-kQueries in Internet of Things vol.2014, 2014, https://doi.org/10.1155/2014/401618
  2. A game theoretic model for dynamic configuration of large-scale intrusion detection signatures vol.75, pp.23, 2016, https://doi.org/10.1007/s11042-015-2508-6
  3. DCCP: an effective data placement strategy for data-intensive computations in distributed cloud computing systems vol.72, pp.7, 2016, https://doi.org/10.1007/s11227-015-1511-z
  4. Design of database for evaluating 3D audio core algorithms vol.75, pp.22, 2016, https://doi.org/10.1007/s11042-015-2679-1