The motive for constructing a high level data model on cloud databases

When traditional database theories applied to large scale computing environments like cloud computing, difficulties encountered in many aspects, such as ACID transaction, closed-world assumption, data consistency, security, and scalability. In this paper, on the basis of analyzing the limitation of closed world assumption for massively computing environments, and from the viewpoint of complex giant system, a high level data model of relational database outlining a solution to large scale computing environments is proposed, in which semantic clusters of data, called data multitrees are taken as distribution units. We mainly investigate the motive for constructing such a data model, and briefly introduce the model to make the paper complete.

[1]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[2]  Prashant Pandey,et al.  Cloud computing , 2010, ICWET.

[3]  Wilson C. Hsieh,et al.  Data management projects at Google , 2006, SIGMOD Conference.

[4]  George W. Furnas,et al.  Multitrees: enriching and reusing hierarchical structure , 1994, CHI '94.

[5]  Hans-Arno Jacobsen,et al.  PNUTS: Yahoo!'s hosted data serving platform , 2008, Proc. VLDB Endow..

[6]  Peng Jing.  New Replication Architecture for Distributed Databases Based on UD-Tree , 2004 .

[7]  Laurian M. Chirica,et al.  The entity-relationship model: toward a unified view of data , 1975, SIGF.

[8]  Peter M G Apers,et al.  Data allocation in distributed database systems , 1988, TODS.

[9]  Dan Pritchett,et al.  BASE: An Acid Alternative , 2008, ACM Queue.

[10]  Frederick H. Lochovsky,et al.  Hierarchical Data-Base Management: A Survey , 1976, CSUR.

[11]  Hal R. Varian,et al.  Designing the perfect auction , 2008, CACM.

[12]  Oren Etzioni,et al.  Sound and Efficient Closed-World Reasoning for Planning , 1997, Artif. Intell..

[13]  K. Dan Levin,et al.  Optimizing distributed data bases: a framework for research , 1975, AFIPS '75.

[14]  Charles W. Bachman.  The data structure set model , 1974, SIGFIDET '74.

[15]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[16]  Surajit Chaudhuri,et al.  DBXplorer: a system for keyword-based search over relational databases , 2002, Proceedings 18th International Conference on Data Engineering.

[17]  Rajkumar Buyya,et al.  Article in Press Future Generation Computer Systems ( ) – Future Generation Computer Systems Cloud Computing and Emerging It Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility , 2022 .

[18]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

[19]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[20]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[21]  Robert L. Grossman,et al.  Compute and storage clouds using wide area high performance networks , 2008, Future Gener. Comput. Syst..

[22]  K. Dan Levin,et al.  Optimal program and data locations in computer networks , 1977, CACM.

[23]  Luis Gravano,et al.  Efficient IR-Style Keyword Search over Relational Databases , 2003, VLDB.

[24]  Christian Bierwirth,et al.  Principles of Systems , 2000 .

[25]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[26]  Patrick Valduriez,et al.  Distributed database systems: where are we now? , 1991, Computer.

[27]  Brian Hayes,et al.  What Is Cloud Computing? , 2019, Cloud Technologies.

[28]  Jun Zhang,et al.  NUITS: a novel user interface for efficient keyword search over databases , 2006, VLDB.

[29]  Kapali P. Eswaran.  Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.

[30]  Wesley W. Chu,et al.  Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[31]  Doug Johnson,et al.  Computing in the Clouds. , 2010 .

[32]  Edward Y. Chang,et al.  Data management projects at Google , 2008, SGMD.

[33]  Vagelis Hristidis,et al.  DISCOVER: Keyword Search in Relational Databases , 2002, VLDB.

[34]  Roy Goldman,et al.  Proximity Search in Databases , 1998, VLDB.

[35]  Patrick Doherty,et al.  Efficient Reasoning Using the Local Closed-World Assumption , 2000, AIMSA.

[36]  James Williams,et al.  Concurrency control and data replication strategies for large-scale and wide-distributed databases , 2001, Proceedings Seventh International Conference on Database Systems for Advanced Applications. DASFAA 2001.

[37]  George Candea,et al.  Middleware-based database replication: the gaps between theory and practice , 2007, SIGMOD Conference.

[38]  Susanne E. Hambrusch,et al.  Data replication for external searching in static tree structures , 2000, CIKM '00.

[39]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[40]  S. Sudarshan,et al.  Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.