%0 Journal Article %1 citeulike:593448 %A Li, Wen-Syan %A Candan, K. S. %A Vu, Quoc %A Agrawal, D. %D 2002 %J Knowledge and Data Engineering, IEEE Transactions on %K research.db.consolidation research.ir.partitioning tech.www %N 4 %P 768--791 %T Query relaxation by structure and semantics for retrieval of logical Web documents %U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1019213 %V 14 %X Since the Web encourages hypertext and hypermedia document authoring (e.g., HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperlinks. A Web document may be authored in multiple ways, such as: (1) all information in one physical page, or (2) a main page and the related information in separate linked pages. Existing Web search engines, however, return only physical pages containing keywords. We introduce the concept of information unit, which can be viewed as a logical Web document consisting of multiple physical pages as one atomic retrieval unit. We present an algorithm to efficiently retrieve information units. Our algorithm can perform progressive query processing. These functionalities are essential for information retrieval on the Web and large XML databases. We also present experimental results on synthetic graphs and real Web data

@article{citeulike:593448, abstract = {Since the Web encourages hypertext and hypermedia document authoring (e.g., HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperlinks. A Web document may be authored in multiple ways, such as: (1) all information in one physical page, or (2) a main page and the related information in separate linked pages. Existing Web search engines, however, return only physical pages containing keywords. We introduce the concept of information unit, which can be viewed as a logical Web document consisting of multiple physical pages as one atomic retrieval unit. We present an algorithm to efficiently retrieve information units. Our algorithm can perform progressive query processing. These functionalities are essential for information retrieval on the Web and large XML databases. We also present experimental results on synthetic graphs and real Web data}, added-at = {2007-03-29T23:05:25.000+0200}, author = {Li, Wen-Syan and Candan, K. S. and Vu, Quoc and Agrawal, D.}, biburl = {https://www.bibsonomy.org/bibtex/2255c9b76ee610cda653f88cce34ec889/msn}, citeulike-article-id = {593448}, interhash = {08a0b806dfa2aa6bd75cd95a01b96e4f}, intrahash = {255c9b76ee610cda653f88cce34ec889}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, keywords = {research.db.consolidation research.ir.partitioning tech.www}, number = 4, pages = {768--791}, priority = {2}, timestamp = {2007-03-29T23:05:25.000+0200}, title = {Query relaxation by structure and semantics for retrieval of logical Web documents}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1019213}, volume = 14, year = 2002 }