|
|
|
                                          
|
Return to Session 1: Web Querying and Mining
In our research on superimposed information management, we have developed applications where information elements in the superimposed layer serve to annotate, comment, restructure, and combine selections from one or more existing documents in the base layer. Base documents tend to be unstructured or semi-structured (HTML pages, Excel spreadsheets, and so on) with marks delimiting selections. Selections in the base layer can be programmatically accessed via marks to retrieve content and context. The applications we have built to date allow creation of new marks and new superimposed elements (that use marks), but they have been browse-oriented and tend to expose the line between superimposed and base layers. Here, we present a new access capability, called bilevel queries, that allows an application or user to query over both layers as a whole. Bi-level queries provide an alternative style of data integration where only relevant portions of a base document are mediated (not the whole document) and the superimposed layer can add information not present in the base layer. We discuss our framework for superimposed information management, an initial implementation of a bi-level query system with an XML Query interface, and suggest mechanisms to improve scalability and performance.
@inproceedings {DBLP:conf/webdb/MurthyMD04, author = {Sudarshan Murthy and David Maier and Lois Delcambre}, title = {Querying Bi-level Information}, pages = {7-12}, ee = {http://webdb2004.cs.columbia.edu/papers/1-2.pdf}, booktitle = {Seventh International Workshop on the Web and Databases}, month = Jun, year = 2004, crossref = {conf/webdb/2004} }  ©2005 Association for Computing Machinery |
