How does query processing and query optimization related?

-

 Query processing and optimization are a fundamental, if not critical, part of any DBMS. To be utilized effectively, the results of queries must be available in the timeframe needed by the submitting user—be it a person, robotic assembly machine, or even another distinct and separate DBMS. 

OR,

Maintaining large databases with high performance is called database query optimization. A distributed database is a group of autonomous cooperating centralized databases, in that query processing requires transferring data from one system to another through a communication network. In the query optimization process, the cost is always associated with each and every query execution plan (QEP).



Comments

Post a Comment

Popular posts from this blog

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

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

Short Note on Security Architecture of E-governance

-
Image
 Security Architecture The security architecture of E-governance is a high-level document that sets the security goals of the e-governance project and describes the procedure that needs to be followed by all the e-governance hierarchies such as users, businesses, operators, etc. An appropriate legal framework is absolutely essential for the systematic and sustained growth of e-governance. Protection of Public Order and Decency  The internet is highly capable of being a saturated and versatile medium at the same time. Its reach is very vast and due to its multimedia capability, its impact can be immediate and profound. So the government has to beware of its potential to create a negative impact on society through the promotion of terrorism, pornography, communalism, violence, etc. Section 67 of the IT Act 2000 of India makes it a punishable offense to “publish or transmit or cause to be published it the electronic form, a material which is lascivious or appeals to the prurient ...
Read more