Skip to main content
SpringerLink
Log in

Database Integration—Multidatabase Systems

  • Chapter
  • First Online:
Principles of Distributed Database Systems

Abstract

Up to this point, we considered distributed DBMSs that are designed in a top-down fashion. In particular, Chap. 2 focuses on techniques for partitioning and allocating a database, while Chap. 4 focuses on distributed query processing over such a database.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Change history

  • 09 September 2020

    The figures included in the original version of this book has been replaced. The figures have been updated throughout the book in this version of the book.

References

  • Abadi, D. J., Carney, D., Çetintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., and Zdonik, S. (2003). Aurora: a new model and architecture for data stream management. VLDB J., 12 (2): 120–139.

    Google Scholar 

  • Abadi, D. J., Ahmad, Y., Balazinska, M., Çetintemel, U., Cherniack, M., Hwang, J.-H., Lindner, W., Maskey, A., Rasin, A., Ryvkina, E., Tatbul, N., Xing, Y., and Zdonik, S. B. (2005). The design of the Borealis stream processing engine. In Proc. 2nd Biennial Conf. on Innovative Data Systems Research, pages 277–289.

    Google Scholar 

  • Abadi, D. J., Marcus, A., Madden, S. R., and Hollenbach, K. (2007). Scalable semantic web data management using vertical partitioning. In Proc. 33rd Int. Conf. on Very Large Data Bases, pages 411–422.

    Google Scholar 

  • Abadi, D. J., Marcus, A., Madden, S., and Hollenbach, K. (2009). SW-Store: a vertically partitioned DBMS for semantic web data management. VLDB J., 18 (2): 385–406.

    Google Scholar 

  • Aberer, K. (2001). P-grid: A self-organizing access structure for P2P information systems. In Proc. Int. Conf. on Cooperative Inf. Syst., pages 179–194.

    Google Scholar 

  • Aberer, K. (2003). Guest editor’s introduction. ACM SIGMOD Rec., 32 (3): 21–22.

    Google Scholar 

  • Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., and Schmidt, R. (2003a). P-grid: a self-organizing structured P2P system. ACM SIGMOD Rec., 32 (3): 29–33.

    Google Scholar 

  • Aberer, K., Cudré-Mauroux, P., and Hauswirth, M. (2003b). Start making sense: The chatty web approach for global semantic agreements. J. Web Semantics, 1 (1): 89–114.

    Google Scholar 

  • Abiteboul, S., Quass, D., McHugh, J., Widom, J., and Wiener, J. (1997). The Lorel query language for semistructured data. Int. J. Digit. Libr., 1 (1): 68–88.

    Google Scholar 

  • Abiteboul, S., Buneman, P., and Suciu, D. (1999). Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann.

    Google Scholar 

  • Abiteboul, S., Manolescu, I., Rigaux, P., Rousset, M.-C., and Senellart, P. (2011). Web Data Management. Cambridge University Press.

    Google Scholar 

  • Abou-Rjeili, A. and Karypis, G. (2006). Multilevel algorithms for partitioning power-law graphs. In Proc. 20th IEEE Int. Parallel & Distributed Processing Symp., pages 124–124.

    Google Scholar 

  • Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D., Silberschatz, A., and Rasin, A. (2009). HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads. Proc. VLDB Endowment, 2 (1): 922–933.

    Google Scholar 

  • Adali, S., Candan, K. S., Papakonstantinou, Y., and Subrahmanian, V. S. (1996a). Query caching and optimization in distributed mediator systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 137–148.

    Google Scholar 

  • Adali, S., Candan, K. S., Papakonstantinou, Y., and Subrahmanian, V. S. (1996b). Query caching and optimization in distributed mediator systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 137–148.

    Google Scholar 

  • Adamic, L. and Huberman, B. (2000). The nature of markets in the world wide web. Quart. J. Electron. Comm., 1: 5–12.

    Google Scholar 

  • Adiba, M. (1981). Derived relations: A unified mechanism for views, snapshots and distributed data. In Proc. 7th Int. Conf. on Very Data Bases, pages 293–305.

    Google Scholar 

  • Adiba, M. and Lindsay, B. (1980). Database snapshots. In Proc. 6th Int. Conf. on Very Data Bases, pages 86–91.

    Google Scholar 

  • Adler, M. and Mitzenmacher, M. (2001). Towards compressing web graphs. In Proc. Data Compression Conf., pages 203–212.

    Google Scholar 

  • Aggarwal, C. C., editor. (2007). Data Streams: Models and Algorithms. Springer.

    Google Scholar 

  • Agichtein, E., Lawrence, S., and Gravano, L. (2004). Learning to find answers to questions on the web. ACM Trans. Internet Tech., 4 (3): 129—162.

    Google Scholar 

  • Agrawal, D. and Sengupta, S. (1993). Modular synchronization in distributed, multiversion databases: Version control and concurrency control. IEEE Trans. Knowl. and Data Eng., 5 (1): 126 –137.

    Google Scholar 

  • Agrawal, D., Das, S., and El Abbadi, A. (2012). Data Management in the Cloud: Challenges and Opportunities. Synthesis Lectures on Data Management. Morgan & Claypool Publishers.

    Google Scholar 

  • Agrawal, S., Narasayya, V., and Yang, B. (2004). Integrating vertical and horizontal partitioning into automated physical database design. In Proc. ACM SIGMOD Int. Conf. on Management of Data.

    Google Scholar 

  • Akal, F., Böhm, K., and Schek, H.-J. (2002). Olap query evaluation in a database cluster: A performance study on intra-query parallelism. In Proc. 6th East European Conf. Advances in Databases and Information Systems, pages 218–231.

    Google Scholar 

  • Akal, F., Türker, C., Schek, H.-J., Breitbart, Y., Grabs, T., and Veen, L. (2005). Fine-grained replication and scheduling with freshness and correctness guarantees. In Proc. 31st Int. Conf. on Very Large Data Bases, pages 565–576.

    Google Scholar 

  • Akbarinia, R. and Martins, V. (2007). Data management in the APPA system. J. Grid Comp., 5 (3): 303–317.

    Google Scholar 

  • Akbarinia, R., Martins, V., Pacitti, E., and Valduriez, P. (2006). Design and implementation of Atlas P2P architecture. In Baldoni, R., Cortese, G., and Davide, F., editors, Global Data Management, pages 98–123. IOS Press.

    Google Scholar 

  • Akbarinia, R., Pacitti, E., and Valduriez, P. (2007a). Processing top-k queries in distributed hash tables. In Proc. 13th Int. Euro-Par Conf., pages 489–502.

    Google Scholar 

  • Akbarinia, R., Pacitti, E., and Valduriez, P. (2007b). Query processing in P2P systems. Technical Report 6112, INRIA, Rennes, France.

    Google Scholar 

  • Akbarinia, R., Pacitti, E., and Valduriez, P. (2007c). Best position algorithms for top-k queries. In Proc. 33rd Int. Conf. on Very Large Data Bases, pages 495–506.

    Google Scholar 

  • Akbarinia, R., Pacitti, E., and Valduriez, P. (2007d). Data currency in replicated dhts. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 211–222.

    Google Scholar 

  • Akidau, T., Balikov, A., Bekiroglu, K., Chernyak, S., Haberman, J., Lax, R., McVeety, S., Mills, D., Nordstrom, P., and Whittle, S. (2013). MillWheel: Fault-tolerant stream processing at internet scale. Proc. VLDB Endowment, 6 (11): 1033–1044.

    Google Scholar 

  • Alagiannis, I., Borovica, R., Branco, M., Idreos, S., and Ailamaki, A. (2012). NoDB: efficient query execution on raw data files. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 241–252.

    Google Scholar 

  • Alagiannis, I., Idreos, S., and Ailamaki, A. (2014). H2O: A hands-free adaptive store. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 1103–1114.

    Google Scholar 

  • Alamoudi, A. A., Grover, R., Carey, M. J., and Borkar, V. R. (2015). External data access and indexing in AsterixDB. In Proc. 24th ACM Int. Conf. on Information and Knowledge Management, pages 3–12.

    Google Scholar 

  • Albutiu, M.-C., Kemper, A., and Neumann, T. (2012). Massively parallel sort-merge joins in main memory multi-core database systems. Proc. VLDB Endowment, 5 (10): 1064–1075.

    Google Scholar 

  • Allard, T., Hébrail, G., Masseglia, F., and Pacitti, E. (2015). Chiaroscuro: Transparency and privacy for massive personal time-series clustering. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 779–794.

    Google Scholar 

  • Alomari, M., Cahill, M., Fekete, A., and Rohm, U. (2008). The cost of serializability on platforms that use snapshot isolation. In Proc. 24th Int. Conf. on Data Engineering, pages 576 –585.

    Google Scholar 

  • Alomari, M., Fekete, A., and Rohm, U. (2009). A robust technique to ensure serializable executions with snapshot isolation DBMS. In Proc. 25th Int. Conf. on Data Engineering, pages 341–352.

    Google Scholar 

  • Alsberg, P. A. and Day, J. D. (1976). A principle for resilient sharing of distributed resources. In Proc. 2nd Int. Conf. on Software Engineering, pages 562–570.

    Google Scholar 

  • Alsubaiee, S., Altowim, Y., Altwaijry, H., Behm, A., Borkar, V. R., Bu, Y., Carey, M. J., Cetindil, I., Cheelangi, M., Faraaz, K., Gabrielova, E., Grover, R., Heilbron, Z., Kim, Y., Li, C., Li, G., Ok, J. M., Onose, N., Pirzadeh, P., Tsotras, V. J., Vernica, R., Wen, J., and Westmann, T. (2014). AsterixDB: A scalable, open source DBMS. Proc. VLDB Endowment, 7 (14): 1905–1916.

    Google Scholar 

  • Altingövde, I. S. and Ulusoy, Ö. (2004). Exploiting interclass rules for focused crawling. IEEE Intelligent Systems, 19 (6): 66–73.

    Google Scholar 

  • Aluç, G. (2015). Workload Matters: A Robust Approach to Physical RDF Database Design. PhD thesis, University of Waterloo.

    Google Scholar 

  • Alvarez, V., Schuhknecht, F. M., Dittrich, J., and Richter, S. (2014). Main memory adaptive indexing for multi-core systems. In Proc. 10th Workshop on Data Management on New Hardware, pages 3:1—-3:10.

    Google Scholar 

  • Amdahl, G. M. (1967). Validity of the single processor approach to achieving large scale computing capabilities. In Proc. Spring Joint Computer Conf., pages 483–485.

    Google Scholar 

  • Amsaleg, L., Franklin, M. J., Tomasic, A., and Urhan, T. (1996). Scrambling query plans to cope with unexpected delays. In Proc. 4th Int. Conf. on Parallel and Distributed Information Systems, pages 208–219.

    Google Scholar 

  • Andreev, K. and Racke, H. (2006). Balanced graph partitioning. Theor. Comp. Sci., 39 (6): 929–939.

    MathSciNet  MATH  Google Scholar 

  • Angles, R. and Gutierrez, C. (2008). The expressive power of SPARQL. In Proc. 7th Int. Semantic Web Conf., pages 114–129.

    Google Scholar 

  • Antoniou, G. and Plexousakis, D. (2018). Semantic web. In Liu, L. and Özsu, M. T., editors, Encyclopedia of Database Systems, pages 3425–3429. Springer New York, New York, NY.

    Google Scholar 

  • Apache. (2016). Apache Giraph. http://giraph.apache.org. Last accessed June 2019.

  • Apers, P., van den Berg, C., Flokstra, J., Grefen, P., Kersten, M., and Wilschut, A. (1992). Prisma/DB: a parallel main-memory relational DBMS. IEEE Trans. Knowl. and Data Eng., 4: 541–554.

    Google Scholar 

  • Apers, P. M. G. (1981). Redundant allocation of relations in a communication network. In Proc. 5th Berkeley Workshop on Distributed Data Management and Computer Networks, pages 245–258.

    Google Scholar 

  • Arasu, A. and Widom, J. (2004). A denotational semantics for continuous queries over streams and relations. ACM SIGMOD Rec., 33 (3): 6–11.

    Google Scholar 

  • Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., and Raghavan, S. (2001). Searching the web. ACM Trans. Internet Tech., 1 (1): 2–43.

    Google Scholar 

  • Arasu, A., Babu, S., and Widom, J. (2006). The CQL continuous query language: Semantic foundations and query execution. VLDB J., 15 (2): 121–142.

    Google Scholar 

  • Armbrust, M., Xin, R. S., Lian, C., Huai, Y., Liu, D., Bradley, J. K., Meng, X., Kaftan, T., Franklin, M. J., Ghodsi, A., and Zaharia, M. (2015). Spark SQL: Relational data processing in Spark. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 1383–1394.

    Google Scholar 

  • Arocena, G. and Mendelzon, A. (1998). WebOQL: Restructuring documents, databases and webs. In Proc. 14th Int. Conf. on Data Engineering, pages 24–33.

    Google Scholar 

  • Asad, O. and Kemme, B. (2016). Adaptcache: Adaptive data partitioning and migration for distributed object caches. In Proc. ACM/IFIP/USENIX 17th Int. Middleware Conf., pages 7:1–7:13.

    Google Scholar 

  • Aspnes, J. and Shah, G. (2003). Skip graphs. In Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 384–393.

    Google Scholar 

  • Avnur, R. and Hellerstein, J. (2000). Eddies: Continuously adaptive query processing. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 261–272.

    Google Scholar 

  • Ayad, A. and Naughton, J. (2004). Static optimization of conjunctive queries with sliding windows over unbounded streaming information sources. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 419–430.

    Google Scholar 

  • Azar, Y., Broder, A. Z., Karlin, A. R., and Upfal, E. (1999). Balanced allocations. SIAM J. on Comput., 29 (1): 180–200.

    MathSciNet  MATH  Google Scholar 

  • Babb, E. (1979). Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst., 4 (1): 1–29.

    Google Scholar 

  • Babcock, B., Babu, S., Datar, M., Motwani, R., and Widom, J. (2002). Models and issues in data stream systems. In Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pages 1–16.

    Google Scholar 

  • Balazinska, M., Kwon, Y., Kuchta, N., and Lee, D. (2007). Moirae: History-enhanced monitoring. In Proc. 3rd Biennial Conf. on Innovative Data Systems Research, pages 375–386.

    Google Scholar 

  • Balke, W.-T., Nejdl, W., Siberski, W., and Thaden, U. (2005). Progressive distributed top-k retrieval in peer-to-peer networks. In Proc. 21st Int. Conf. on Data Engineering, pages 174–185.

    Google Scholar 

  • Bancilhon, F. and Spyratos, N. (1981). Update semantics of relational views. ACM Trans. Database Syst., 6 (4): 557–575.

    MATH  Google Scholar 

  • Barbara, D., Garcia-Molina, H., and Spauster, A. (1986). Policies for dynamic vote reassignment. In Proc. 6th IEEE Int. Conf. on Distributed Computing Systems, pages 37–44.

    Google Scholar 

  • Barbara, D., Molina, H. G., and Spauster, A. (1989). Increasing availability under mutual exclusion constraints with dynamic voting reassignment. ACM Trans. Comp. Syst., 7 (4): 394–426.

    Google Scholar 

  • Barthels, C., Loesing, S., Alonso, G., and Kossmann, D. (2015). Rack-scale in-memory join processing using RDMA. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 1463–1475.

    Google Scholar 

  • Batini, C. and Lenzirini, M. (1984). A methodology for data schema integration in entity-relationship model. IEEE Trans. Softw. Eng., SE-10 (6): 650–654.

    Google Scholar 

  • Batini, C., Lenzirini, M., and Navathe, S. B. (1986). A comparative analysis of methodologies for database schema integration. ACM Comput. Surv., 18 (4): 323–364.

    Google Scholar 

  • Beeri, C., Bernstein, P. A., and Goodman, N. (1989). A model for concurrency in nested transaction systems. J. ACM, 36 (2): 230–269.

    MathSciNet  MATH  Google Scholar 

  • Bell, D. and Grimson, J. (1992). Distributed Database Systems. Addison Wesley. Reading.

    MATH  Google Scholar 

  • Bell, D. and Lapuda, L. (1976). Secure computer systems: Unified exposition and Multics interpretation. Technical Report MTR-2997 Rev.1, MITRE Corp, Bedford, MA.

    Google Scholar 

  • Berenson, H., Bernstein, P., Gray, J., Melton, J., O’Neil, E., and O’Neil, P. (1995). A critique of ansi sql isolation levels. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 1–10.

    Google Scholar 

  • Bergamaschi, S. (2001). Semantic integration of heterogeneous information sources. Data & Knowl. Eng., 36 (3): 215–249.

    MATH  Google Scholar 

  • Bergman, M. K. (2001). The deep web: Surfacing hidden value. J. Electronic Publishing, 7 (1).

    Google Scholar 

  • Bergsten, B., Couprie, M., and Valduriez, P. (1991). Prototyping DBS3, a shared-memory parallel database system. In Proc. Int. Conf. on Parallel and Distributed Information Systems, pages 226–234.

    Google Scholar 

  • Bergsten, B., Couprie, M., and Valduriez, P. (1993). Overview of parallel architectures for databases. The Comp. J., 36 (8): 734–739.

    Google Scholar 

  • Berkholz, C., Keppeler, J., and Schweikardt, N. (2017). Answering conjunctive queries under updates. In Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pages 303–318.

    Google Scholar 

  • Berlin, J. and Motro, A. (2001). Autoplex: Automated discovery of content for virtual databases. In Proc. Int. Conf. on Cooperative Inf. Syst., pages 108–122.

    Google Scholar 

  • Berners-Lee, T. (2006). Linked data. Accessible at https://www.w3.org/DesignIssues/LinkedData.html. Last accessed June 2019.

    MATH  Google Scholar 

  • Bernstein, P. and Blaustein, B. (1982). Fast methods for testing quantified relational calculus assertions. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 39–50.

    Google Scholar 

  • Bernstein, P. and Melnik, S. (2007). Model management: 2.0: Manipulating richer mappings. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 1–12.

    Google Scholar 

  • Bernstein, P., Blaustein, B., and Clarke, E. M. (1980a). Fast maintenance of semantic integrity assertions using redundant aggregate data. In Proc. 6th Int. Conf. on Very Data Bases, pages 126–136.

    Google Scholar 

  • Bernstein, P., Shipman, P., and Rothnie, J. B. (1980b). Concurrency control in a system for distributed databases (SDD-1). ACM Trans. Database Syst., 5 (1): 18–51.

    Google Scholar 

  • Bernstein, P. A. and Chiu, D. M. (1981). Using semi-joins to solve relational queries. J. ACM, 28 (1): 25–40.

    MATH  Google Scholar 

  • Bernstein, P. A. and Goodman, N. (1981). Concurrency control in distributed database systems. ACM Comput. Surv., 13 (2): 185–222.

    MathSciNet  Google Scholar 

  • Bernstein, P. A. and Goodman, N. (1983). Multiversion concurrency control — theory and algorithms. ACM Trans. Database Syst., 8 (4): 465–483.

    MathSciNet  MATH  Google Scholar 

  • Bernstein, P. A. and Goodman, N. (1984). An algorithm for concurrency control and recovery in replicated distributed databases. ACM Trans. Database Syst., 9 (4): 596–615.

    MathSciNet  Google Scholar 

  • Bernstein, P. A. and Newcomer, E. (1997). Principles of Transaction Processing for the Systems Professional. Morgan Kaufmann.

    MATH  Google Scholar 

  • Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., and Jr, J. B. R. (1981). Query processing in a system for distributed databases (SDD-1). ACM Trans. Database Syst., 6 (4): 602–625.

    Google Scholar 

  • Bernstein, P. A., Hadzilacos, V., and Goodman, N. (1987). Concurrency Control and Recovery in Database Systems. Addison Wesley.

    Google Scholar 

  • Bernstein, P. A., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., and Zaihrayeu, I. (2002). Data management for peer-to-peer computing : A vision. In Proc. 5th Int. Workshop on the World Wide Web and Databases, pages 89–94.

    Google Scholar 

  • Bernstein, P. A., Fekete, A., Guo, H., Ramakrishnan, R., and Tamma, P. (2006). Relexed concurrency serializability for middle-tier caching and replication. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 599–610.

    Google Scholar 

  • Beyer, K. S., Ercegovac, V., Krishnamurthy, R., Raghavan, S., Rao, J., Reiss, F., Shekita, E. J., Simmen, D. E., Tata, S., Vaithyanathan, S., and Zhu, H. (2009). Towards a scalable enterprise content analytics platform. Q. Bull. IEEE TC on Data Eng., 32 (1): 28–35.

    Google Scholar 

  • Bharat, K. and Broder, A. (1998). A technique for measuring the relative size and overlap of public web search engines. Comp. Networks and ISDN Syst., 30: 379 – 388. (Proc. 7th Int. World Wide Web Conf.).

    Google Scholar 

  • Bhowmick, S. S., Madria, S. K., and Ng, W. K. (2004). Web Data Management. Springer.

    MATH  Google Scholar 

  • Bifet, A., Gavaldà, R., Holmes, G., and Pfahringer, B. (2018). Machine Learning for Data Streams: with Practical Examples in MOA. MIT Press.

    Google Scholar 

  • Binnig, C., Hildenbrand, S., Färber, F., Kossmann, D., Lee, J., and May, N. (2014). Distributed snapshot isolation: global transactions pay globally, local transactons pay locally. VLDB J., 23: 987–1011.

    Google Scholar 

  • Biscondi, N., Brunie, L., Flory, A., and Kosch, H. (1996). Encapsulation of intra-operation parallelism in a parallel match operator. In Proc. ACPC Conf., volume 1127 of Lecture Notes in Computer Science, pages 124–135.

    Google Scholar 

  • Bitton, D., Boral, H., DeWitt, D. J., and Wilkinson, W. K. (1983). Parallel algorithms for the execution of relational database operations. ACM Trans. Database Syst., 8 (3): 324–353.

    Google Scholar 

  • Bitton, D., DeWitt, D. J., Hsiao, D. K., and Menon, J. (1984). A taxonomy of parallel sorting. ACM Comput. Surv., 16 (3): 287–318.

    MathSciNet  MATH  Google Scholar 

  • Bizer, C., Vidal, M.-E., and Skaf-Molli, H. (2018). Linked open data. In Liu, L. and Özsu, M. T., editors, Encyclopedia of Database Systems, pages 2096–2101. Springer New York, New York, NY.

    Google Scholar 

  • Blanas, S., Patel, J. M., Ercegovac, V., Rao, J., Shekita, E. J., and Tian, Y. (2010). A comparison of join algorithms for log processing in MapReduce. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 975–986.

    Google Scholar 

  • Blaustein, B. (1981). Enforcing Database Assertions: Techniques and Applications. PhD thesis, Harvard University, Cambridge, Mass.

    Google Scholar 

  • Bleiholder, J. and Naumann, F. (2009). Data fusion. ACM Comput. Surv., 41 (1): 1:1–1:41.

    Google Scholar 

  • Bonato, A. (2008). A Course on the Web Graph. American Mathematical Society.

    MATH  Google Scholar 

  • Bondiombouy, C. and Valduriez, P. (2016). Query processing in multistore systems: an overview. Int. J. Cloud Computing, 5 (4): 309–346.

    Google Scholar 

  • Bondiombouy, C., Kolev, B., Levchenko, O., and Valduriez, P. (2016). Multistore big data integration with CloudMdsQL. Trans. Large-Scale Data- and Knowledge-Centered Syst., 28: 48–74.

    Google Scholar 

  • Bonifati, A., Summa, G., Pacitti, E., and Draidi, F. (2014). Query reformulation in PDMS based on social relevance. Trans. Large-Scale Data- and Knowledge-Centered Syst., 13: 59–90.

    Google Scholar 

  • Bonnet, P., Gehrke, J., and Seshadri, P. (2001). Towards sensor database systems. In Proc. 2nd Int. Conf. on Mobile Data Management, pages 3–14.

    Google Scholar 

  • Bönström, V., Hinze, A., and Schweppe, H. (2003). Storing RDF as a graph. In Proc. 1st Latin American Web Congress, pages 27 – 36.

    Google Scholar 

  • Boral, H. and DeWitt, D. (1983). Database machines: An idea whose time has passed? A critique of the future of database machines. In Proc. 3rd Int. Workshop on Database Machines, pages 166–187.

    Google Scholar 

  • Boral, H., Alexander, W., Clay, L., Copeland, G., Danforth, S., Franklin, M., Hart, B., Smith, M., and Valduriez, P. (1990). Prototyping bubba, a highly parallel database system. IEEE Trans. Knowl. and Data Eng., 2 (1): 4–24.

    Google Scholar 

  • Borkar, D., Mayuram, R., Sangudi, G., and Carey, M. J. (2016). Have your data and query it too: From key-value caching to big data management. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 239–251.

    Google Scholar 

  • Bornea, M. A., Dolby, J., Kementsietsidis, A., Srinivas, K., Dantressangle, P., Udrea, O., and Bhattacharjee, B. (2013). Building an efficient RDF store over a relational database. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 121–132.

    Google Scholar 

  • Borr, A. (1988). High performance SQL through low-level system integration. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 342–349.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada

    M. Tamer Özsu

  2. Inria and LIRMM, University of Montpellier, Montpellier, France

    Patrick Valduriez

Authors
  1. M. Tamer Özsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Valduriez
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Özsu, M.T., Valduriez, P. (2020). Database Integration—Multidatabase Systems. In: Principles of Distributed Database Systems. Springer, Cham. https://doi.org/10.1007/978-3-030-26253-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26253-2_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26252-5

  • Online ISBN: 978-3-030-26253-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation