"Relational databases, as implemented in relational database management systems, have become a predominant choice for the storage of information in databases used for, for example, financial records, manufacturing and logistical information, personnel data, and other applications. As computer power has increased, the inefficiencies of relational databases, which made them impractical in earlier times, have been outweighed by their ease of use for conventional applications. The three leading open source implementations are MySQL, PostgreSQL, and SQLite. MySQL is a relational database management system (RDBMS) that runs as a server providing multi-user access to a number of databases. The 'M' in the acronym of the popular LAMP software stack refers to MySQL. Its popularity for use with web applications is closely tied to the popularity of PHP (the 'P' in LAMP). Several high-traffic web sites use MySQL for data storage and logging of user data.
"A database index is a data structure that improves the speed of data retrieval operations on a database table. A database index can be created using one or more columns of a database table, providing the basis for both rapid random lookups and efficient access of ordered records. The disk space required to store the index is typically less than that required by the table (since indexes usually contain only the key-fields according to which the table is to be arranged, and exclude all the other details in the table), yielding the possibility to store indexes in memory for a table whose data is too large to store in memory. Indexes can be implemented using a variety of data structures. Popular indexes include balanced trees, B+ trees and hashes.
"A graph is an abstract representation of a set of objects where at least some pairs of the objects are connected by links. The interconnected objects are commonly referred to as nodes, and the links that connect nodes are called edges. Modeling data in a graph structure, however, imposes challenges to scalability and performance. Queries that require traversal of a graph structure may require many database lookups. Highly scalable systems typically rely on caching and indexing to improve query response times and overall performance."
As a supplement to the background information on this patent, VerticalNews correspondents also obtained the inventors' summary information for this patent: "The present invention provides methods, apparatuses and systems directed to an indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance. These and other features, aspects, and advantages of the disclosure are described in more detail below in the detailed description and in conjunction with the following figures."
For additional information on this patent, see: Singh, Sanjeev; Taylor,
Keywords for this news article include: Facebook Inc., Information Technology, Information and Data Management.
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2013, NewsRx LLC
Most Popular Stories
- Boehner Lashes Out Against Ted Cruz, Far Right
- TFA Recruiting DACA Recipients
- Hawaii Official Who Release Obama Certificate Only Victim of Plane Crash
- Cheap Gas Drives Down U.S. Wholesale Prices Again
- Holiday Shopping Off to a Slow Start This Season
- Ford Plans New Cars, Jobs in 2014
- Gold, Silver Slide on Prospects of Fed Exit
- 'Rape Insurance' Bill Passes in Michigan
- Producer Price Index Dropped in November
- Beyonce Releases New Album With No Marketing