ACM Home Page
Please provide us with feedback. Feedback
Querying bi-level information
Full text PdfPdf (778 KB)
Source WebDB; Vol. 67 archive
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 table of contents
Paris, France
SESSION: Paper session 1: web querying and mining table of contents
Pages: 7 - 12  
Year of Publication: 2004
Authors
Sudarshan Murthy  OGI School of Sc. & Eng. at OHSU, Beaverton, OR
David Maier  OGI School of Sc. & Eng. at OHSU, Beaverton, OR
Lois Delcambre  OGI School of Sc. & Eng. at OHSU, Beaverton, OR
Sponsor
: INRIA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1017074.1017078
What is a DOI?

ABSTRACT

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 bi-level 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
Camillo, S. D., Heuser, C. A., and Mello, R. Querying Heterogeneous XML Sources through a Conceptual Schema. In Proceedings of ER 2003 (Chicago, October 13--16, 2003). Springer LNCS 2813, 2003. 186--199.
 
4
Carey, M. J., Haas, L. M., Schwarz, P. M., Arya, M., Cody, W. F., Fagin, R., Flickner, M., Luniewski, A. W., Niblack, W., Petkovic, D., Thomas, J., Williams, J. H., and Wimmers, E. L. Towards heterogeneous multimedia information systems: The Garlic approach. IBM Technical Report RJ 9911, 1994.
 
5
6
 
7
 
8
Maier, D., and Delcambre, L. Superimposed Information for the Internet. In Informal Proceedings of WebDB '99 (Philadelphia, June 3--4, 1999). 1--9.
 
9
Microsoft. COM: The Component Object Model Specification, Microsoft Corporation. 1995.
 
10
Microsoft. MS XML 4.0 Software Development Kit. Microsoft Corporation. Available online at http://msdn.microsoft.com/
 
11
Microsoft. XQuery Demo. Microsoft Corporation. Available online at http://xqueryservices.com/
 
12
 
13


Collaborative Colleagues:
Sudarshan Murthy: colleagues
David Maier: colleagues
Lois Delcambre: colleagues