Abstract
In recent years the inverted lists evaluation model along with holistic stack-based algorithms have been established as the most prominent techniques for evaluating XML queries on large persistent XML data. In this framework, we are using materialized views for optimizing XML queries. We consider a novel approach which instead of materializing the answer of a view materializes exactly the inverted sublists that are necessary for computing the answer of the view. This originality allows storing view materializations as compressed bitmaps, a solution that minimizes the materialization space and empowers performing optimization operations as CPU-efficient bitwise operations. To realize the potential of bitmap materialized views in optimizing query performance, we define and address the following problem (view configuration problem): given an XML tree and its schema find a template of tree-pattern views (view configuration) such that: (a) the views of this configuration can answer all the queries that can be issued against the schema, (b) their materialization fits in the space provided, and (c) evaluating the queries using these views minimizes the overall query evaluation cost. We consider an instance of this problem for tree pattern queries. Our intension is to find view configurations whose materializations are small enough to be stored in main memory. We find two candidate solution configurations and we identify cases where views can be excluded from materialization in a configuration without affecting query performance. In order to compare our approach with an approach which also can support the optimization of every query on the schema, we implemented an improvement of a state-of-the-art approach which is based on structural indexes. Our experimental results show that our approach is stable, greatly improves evaluating queries without materialized views, outperforms the structural index approach on all test cases and is very close to the optimal. These results characterize our approach as the best candidate for supporting the optimization of queries in the framework of the inverted lists model.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Agrawal, S., Chaudhuri, S., Narasayya, V.R.: Automated Selection of Materialized Views and Indexes in SQL Databases. In: VLDB, pp. 496–505 (2000)
Arion, A., Benzaken, V., Manolescu, I., Papakonstantinou, Y.: Structured materialized views for XML queries. In: VLDB, pp. 87–98 (2007)
Balmin, A., Özcan, F., Beyer, K.S., Cochrane, R.J., Pirahesh, H.: A framework for using materialized XPath views in XML query processing. In: VLDB, pp. 60–71 (2004)
Barta, A., Consens, M.P., Mendelzon, A.O.: Benefits of path summaries in an XML query optimizer supporting multiple access methods. In: VLDB, pp. 133–144 (2005)
Bello, R.G., Dias, K., Downing, A., Feenan, Jr., J.J., Finnerty, J.L., Norcott, W.D., Sun, H., Witkowski, A., Ziauddin, M.: Materialized views in oracle. In: VLDB, pp. 659–664 (1998)
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310–321 (2002)
Chaudhuri, S., Krishnamurthy, R., Potamianos, S., Shim, K.: Optimizing queries with materialized views. In: CDE, pp. 190–200 (1995)
Chaudhuri, S., Shim, K.: Optimizing queries with aggregate views. In: EDBT, pp. 167–182 (1996)
Chen, D., Chan, C.-Y.: View join: efficient view-based evaluation of tree pattern queries. In: ICDE, pp. 816–827 (2010)
Chien, S.-Y., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: VLDB, pp. 263–274 (2002)
Chirkova, R., Halevy, A.Y., Suciu, D.: A formal perspective on the view selection problem. In: VLDB, pp. 59–68 (2001)
Goldstein, J., Larson, P.-Å.: Optimizing queries using materialized views: a practical, scalable solution. In: SIGMOD, pp. 331–342 (2001)
Gou, G., Chirkova, R.: Efficiently querying large XML data repositories: a survey. IEEE Trans. Knowl. Data Eng. 19(10), 1381–1403 (2007)
Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: SIGMOD Conference, pp. 205–216 (1996)
Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins on indexed XML documents. In: VLDB, pp. 273–284 (2003)
Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: SIGMOD, pp. 779–790 (2004)
Lakshmanan, L.V.S., Wang, H., Zhao, Z.: Answering tree pattern queries using views. In: VLDB, pp. 571–582 (2006)
Mandhani, B., Suciu, D.: Query caching and view selection for XML databases. In: VLDB, pp. 469–480 (2005)
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51(1), 2–45 (2004)
Milo, T., Suciu, D.: Index structures for path expressions. In: ICDT, pp. 277–295 (1999)
Moro, M.M., Vagena, Z., Tsotras, V.J.: Tree-pattern queries on a lightweight XML processor. In: VLDB, pp. 205–216 (2005)
Moro, M.M., Vagena, Z., Tsotras, V.J.: Evaluating structural summaries as access methods for XML. In: WWW, pp. 1079–1080 (2006)
Neven, F., Schwentick, T.: Xpath containment in the presence of disjunction, dtds, and variables. In: ICDT, pp. 312–326 (2003)
Peng, F., Chawathe, S.S.: XPath queries on streaming data. In: SIGMOD, pp. 431–442 (2003)
Phillips, D., Zhang, N., Ilyas, I.F., Özsu, M.T.: InterJoin: exploiting indexes and materialized views in XPath evaluation. In: SSDBM, pp. 13–22 (2006)
Rao, P., Prix, B.Moon.: Indexing and querying XML using pru¨fer sequences. In: ICDE, pp. 288–300 (2004)
Tang, N., Yu, J.X., Özsu, M.T., Choi, B., Wong, K.-F.: Multiple materialized view selection for XPath query rewriting. In: ICDE, pp. 873–882 (2008)
Tang, N., Yu, J.X., Tang, H., Özsu, M.T., Boncz, P.A.: Materialized view selection in XML databases. In: DASFAA, pp. 616–630 (2009)
Tang, J., Zhou, S.: A theoretic framework for answering XPath queries using views. In: XSym, pp. 18–33 (2005)
Theodoratos, D., Sellis, T.K.: Data warehouse configuration. In: VLDB, pp. 126–135 (1997)
Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: a dynamic index method for querying XML data by tree structures. In: SIGMOD, pp. 110–121 (2003)
Wang, J., Yu, J.X.: XPath rewriting using multiple views. In: DEXA, pp. 493–507 (2008)
Wu, K., Otoo, E.J., Shoshani, A.: Optimizing bitmap indices with efficient compression. ACM Trans. Database Syst. 31(1), 1–38 (2006)
Wu, X., Souldatos, S., Theodoratos, D., Dalamagas, T., Sellis, T.K.: Efficient evaluation of generalized path pattern queries on XML data. In: WWW, pp. 835–844 (2008)
Wu, X., Souldatos, S., Theodoratos, D., Dalamagas, T., Vassiliou, Y., Sellis, T.K.: Processing and evaluating partial tree pattern queries on XML data. IEEE Trans. Knowl. Data Eng. 24(12), 2244–2259 (2012)
Wu, X., Theodoratos, D., Wang, W.H.: Answering XML queries using materialized views revisited. In: CIKM, pp. 475–484 (2009)
Wu, X., Theodoratos, D., Wang, W.H., Sellis, T.: Optimizing XML queries: bitmapped materialized views vs. indexes. Inf. Syst. 38(6), 863–884 (2013)
Xu, W., Özsoyoglu, Z.M.: Rewriting XPath queries using materialized views. In: VLDB, pp. 121–132 (2005)
Zaharioudakis, M., Cochrane, R., Lapis, G., Pirahesh, H., Urata, M.: Answering complex SQL queries using automatic summary tables. In: SIGMOD, pp. 105–116 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research of this author was supported by the National Natural Science Foundation of China under Grant No. 61202035 and 61272110.
Rights and permissions
About this article
Cite this article
Wu, X., Theodoratos, D. & Kementsietsidis, A. Configuring bitmap materialized views for optimizing XML queries. World Wide Web 18, 607–632 (2015). https://doi.org/10.1007/s11280-013-0272-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-013-0272-y