Using Nested Tables for Representing and Querying Semistructured Web Data
This paper proposes an approach for representing and querying semistructured Web data, which is based on nested tables allowing internal nested structural variations. Our motivation is to reduce the complexity found in typical query languages for semistructured data and to provide users with an alternative for quickly querying data obtained from multiple-record Web pages. We show the feasibility of our proposal by developing a prototype for a graphical query interface called QSByE (Querying Semistructured data By Example), which implements a set of QBE-like operations that extends typical nested-relational-algebra operations to handle semistructured data.
KeywordsRelational Algebra Internal Table Query Interface Popular Music Semistructured Data
- 1.Abiteboul, S., Quass, D., McHugh, J., Widom, J., and Wiener, J. The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries 1, 1 (1997), 68–88.Google Scholar
- 2.Colby, L. S. A Recursive Algebra and Query Optimization for Nested Relations. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data (Portland, Oregon, 1989), pp. 273–283.Google Scholar
- 3.Evangelista-Filha, I. M. R., Laender, A. H. F., and Silva, A. S. Querying Semistructured Data By Example: The QSByE Interface. In Proceedings of the International Workshop on Information Integration on the Web (Rio de Janeiro, Brazil, 2001), pp. 156–163.Google Scholar
- 5.Thomas, S. J., and Fischer, P. C. Nested Relational Structures. Advances in Computing Research 3 (1986), 269–307.Google Scholar