Skip to main content

Modeling Functional Data Sources as Relations

  • Conference paper
Conceptual Modeling – ER 2004 (ER 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3288))

Included in the following conference series:

  • 959 Accesses

Abstract

In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web sites. We discuss the problem of modeling such data sources as a set of relations, of determining whether a given query expressed on these relations can be translated into a combination of functions defined by the data sources, and of finding an optimal plan to do so.

We show that, if the data source is modeled as a single relation, an optimal plan can be found in a time linear in the number of functions in the source but, if the source is modeled as a number of relations that can be joined, finding the optimal plan is NP-hard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Damiani, E., Tanca, L.: Semantic approaches to structuring and querying web sites. In: DS-7 (1997)

    Google Scholar 

  2. Liu, Z., Li, F., Ng, W.K.: Wiccap data model: Mapping physical websites to logical views. In: Spaccapietra, S., March, S.T., Kambayashi, Y. (eds.) ER 2002. LNCS, vol. 2503, pp. 120–134. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. da Silva, S., Evangelista Filha, I.M., Laender, A.H.F., Embley, D.W.: Representing and querying semistructured web data using nested tables with structural variants. In: Spaccapietra, S., March, S.T., Kambayashi, Y. (eds.) ER 2002. LNCS, vol. 2503, pp. 135–151. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Zadorozhny, V., Raschid, L., Vidal, M.-E., Urhan, T., Bright, L.: Efficient evaluation of queries in a mediator for websources. In: Proceedings of ACM SIGMOD (2002)

    Google Scholar 

  5. Santini, S.: Notes on a relational model of functional data sources. tech. rep., BIRN-CC, University of California, San Diego (2003), http://ssantini.ucsd.edu/personal/bibliography/all-by-year/2003/s426long.pdf

  6. Yerneni, R., Li, C., Garcia-Molina, H., Ullman, J.: Computing capabilities of mediators. In: Proceedings of ACM SIGMOD, pp. 443–454 (1999)

    Google Scholar 

  7. Li, Z., Chen, H.: Computing strong/weak bisimulation equivalences and observation congruence for value-passing processes. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 300–314. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santini, S., Gupta, A. (2004). Modeling Functional Data Sources as Relations. In: Atzeni, P., Chu, W., Lu, H., Zhou, S., Ling, TW. (eds) Conceptual Modeling – ER 2004. ER 2004. Lecture Notes in Computer Science, vol 3288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30464-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30464-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23723-5

  • Online ISBN: 978-3-540-30464-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics