What is Google Cloud Datastore? Features of Google Cloud Datastore.

-

 GOOGLE CLOUD DATASTORE

Google Cloud Datastore is a Google Cloud Platform service that provides a highly scalable, fully managed NoSQL database. Cloud Datastore is based on Bigtable and Megastore technologies from Google. Cloud Datastore is a NoSQL document database designed for online and mobile applications that require automated scalability, excellent performance, and simplicity of development.


Features of Google Cloud Datastore include:

Atomic transactions. 

Cloud Datastore can perform a series of operations in which they succeed.


High availability of reads and writes.

 Cloud Datastore is hosted in Google data centers, which employ redundancy to reduce the effects of single points of failure.


Massive scalability with high performance. 

To manage scalability automatically, Cloud Datastore has a distributed design. Cloud Datastore employs a combination of indexes and query limitations to ensure that your queries grow with the size of your result set rather than the size of your data set.


Flexible storage and querying of data. 

Cloud Datastore is easily mapped to object-oriented and scripting languages, and it is accessible to applications via a variety of clients. It also has a query language that is similar to SQL.


Balance of strong and eventual consistency.

 Cloud Datastore assures that entity lookups using key and ancestor searches always provide highly consistent results. All other searches become consistent in the end. The consistency models enable your application to provide an excellent user experience even when dealing with massive volumes of data and users. 


Encryption at rest. 

Cloud Datastore automatically encrypts all data before it is written to disk and immediately decrypts the data when accessed by an authorized user. For further information, see Server-Side Encryption. 


Fully managed with no planned downtime. 

Google manages the Cloud Datastore service, allowing you to focus on your application. When the service is scheduled for an upgrade, your application can continue to use Cloud Datastore.



Comments

Post a Comment

Popular posts from this blog

Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?

-
Image
a) A Snowflake Shema is shown in figure below: b) The specific OLAP operations to be performed: 1. Roll-up on course from course_id to department. 2. Roll-up on a student from student_id to university. 3. Dice on course, student with department ="CS" and university = "biguniversity" 4. Drill-down on a student from the university to student_name. c) N = 4 dimensions The cube will contain 54 = 625 cuboids.
Read more

Explain Parallel Efficiency of MapReduce.

-
Image
 PARALLEL EFFICIENCY OF MAP-REDUCE It is worth trying to figure out what is the parallel efficiency of MapReduce. Now let us assume that the data produced after the map phase is σ times the original data size D (σD), further, we assume that there are P processors which in turn perform map and reduce operations depending on which phase they are used in, so we do not have any wastage of processors. Also, the algorithm itself is assumed to do wD useful work, w is not necessarily a constant it could be D^2 or something like that, but the point is that there is some amount of useful work being done even if you have a single processor and that's wD. Now let us look at the overheads of doing the computation wD using MapReduce. After the map operation, instead of D data items, we have σD data items in P pieces, so each mapper writes data to their local disk. So, P there is some overhead associated with writing this data. Next, this data has to be read by each reducer before it can begin ...
Read more

Suppose that a data warehouse consists of the four dimensions; date, spectator, location, and game, and the two measures, count and charge, where charge is the fee that a spectator pays when watching a game on a given date. Spectators may be students, adults, or seniors, with each category having its own charge rate. a) Draw a star schema diagram for the data b) Starting with the base cuboid [date; spectator; location; game], what specific OLAP operations should perform in order to list the total charge paid by student spectators at GM Place in 2004?

-
Image
  b) The specific OLAP operations to be performed are: 1. Roll-up on date from date id to year. 2. Roll-up on spectator from spectator id to status. 3. Roll-up on location from location id to location name. 4. Roll-up on the game from game id to all. 5. Dice with status= “students”, location name= “GM Place”, and year=2004
Read more