Caching in the ORM ================== Every application is different, we could have models whose data change frequently and others that rarely change. Accessing database systems is often one of the most common bottlenecks in terms of performance. This is due to the complex connection/communication processes that PHP must do in each request to obtain data from the database. Therefore, if we want to achieve good performance we need to add some layers of caching where the application requires it. This chapter explains the possible points where it is possible to implement caching to improve performance. The framework gives you the tools to implement the cache where you demand of it according to the architecture of your application. Caching Resultsets ------------------ A well established technique to avoid the continuous access to the database is to cache resultsets that don't change frequently using a system with faster access (usually memory). When :doc:`Phalcon\\Mvc\\Model <../api/Phalcon_Mvc_Model>` requires a service to cache resultsets, it will request it to the Dependency Injector Container with the convention name "modelsCache". As Phalcon provides a component to :doc:`cache ` any kind of data, we'll explain how to integrate it with Models. First, you must register it as a service in the services container: .. code-block:: php set('modelsCache', function() { //Cache data for one day by default $frontCache = new \Phalcon\Cache\Frontend\Data(array( "lifetime" => 86400 )); //Memcached connection settings $cache = new \Phalcon\Cache\Backend\Memcache($frontCache, array( "host" => "localhost", "port" => "11211" )); return $cache; }); You have complete control in creating and customizing the cache before being used by registering the service as an anonymous function. Once the cache setup is properly defined you could cache resultsets as follows: .. code-block:: php array("key" => "my-cache") )); // Cache the resultset for only for 5 minutes $products = Products::find(array( "cache" => array("key" => "my-cache", "lifetime" => 300) )); // Using a custom cache $products = Products::find(array("cache" => $myCache)); Caching could be also applied to resultsets generated using relationships: .. code-block:: php getComments(array( "cache" => array("key" => "my-key") )); // Get comments related to a post, setting lifetime $comments = $post->getComments(array( "cache" => array("key" => "my-key", "lifetime" => 3600) )); When a cached resultset needs to be invalidated, you can simply delete it from the cache using the previously specified key. Note that not all resultsets must be cached. Results that change very frequently should not be cached since they are invalidated very quickly and caching in that case impacts performance. Additionally, large datasets that do not change frequently could be cached, but that is a decision that the developer has to make based on the available caching mechanism and whether the performance impact to simply retrieve that data in the first place is acceptable. Overriding find/findFirst ------------------------- As seen above, these methods are available in models that inherit :doc:`Phalcon\\Mvc\\Model <../api/Phalcon_Mvc_Model>`: .. code-block:: php $value) { if (is_scalar($value)) { $uniqueKey[] = $key . ':' . $value; } else { if (is_array($value)) { $uniqueKey[] = $key . ':[' . self::_createKey($value) .']'; } } } return join(',', $uniqueKey); } public static function find($parameters=null) { //Create an unique key based on the parameters $key = self::_createKey($parameters); if (!isset(self::$_cache[$key])) { //Store the result in the memory cache self::$_cache[$key] = parent::find($parameters); } //Return the result in the cache return self::$_cache[$key]; } public static function findFirst($parameters=null) { // ... } } Access the database is several times slower than calculate a cache key, you're free in implement the key generation strategy you find better for your needs. Note that a good key avoids collisions as much as possible, this means that different keys returns unrelated records to the find parameters. In the above example, we used a cache in memory, it is useful as a first level cache. Once we have the memory cache, we can implement a second level cache layer like APC/XCache or a NoSQL database: .. code-block:: php array("key" => "my-cache", "lifetime" => 300) )); This gives us the freedom to cache specific queries, however if we want to cache globally every query performed over the model, we can override the find/findFirst method to force every query to be cached: .. code-block:: php self::_createKey($parameters), "lifetime" => 300 ); } return parent::find($parameters); } public static function findFirst($parameters=null) { //... } } Caching PHQL Queries -------------------- All queries in the ORM, no matter how high level syntax we used to create them are handled internally using PHQL. This language gives you much more freedom to create all kinds of queries. Of course these queries can be cached: .. code-block:: php modelsManager->createQuery($phql); $query->setCache(array( "key" => "cars-by-name", "lifetime" => 300 )); $cars = $query->execute(array( 'name' => 'Audi' )); If you don't want to use the implicit cache just save the resulset into your favorite cache backend: .. code-block:: php modelsManager->executeQuery($phql, array( 'name' => 'Audi' )); apc_store('my-cars', $cars); Reusable Related Records ------------------------ Some models may have relationships to other models. This allows us to easily check the records that relate to instances in memory: .. code-block:: php customer; //Print his/her name echo $customer->name, "\n"; This example is very simple, a customer is queried and can be used as required, for example, to show its name. This also applies if we retrieve a set of invoices to show customers that correspond to these invoices: .. code-block:: php customer; //Print his/her name echo $customer->name, "\n"; } A customer may have one or more bills, this means that the customer may be unnecessarily more than once. To avoid this, we could mark the relationship as reusable, this way, we tell the ORM to automatically reuse the records instead of re-querying them again and again: .. code-block:: php belongsTo("customers_id", "Customer", "id", array( 'reusable' => true )); } } This cache works in memory only, this means that cached data are released when the request is terminated. You can add a more sophisticated cache for this scenario overriding the models manager: .. code-block:: php setShared('modelsManager', function() { return new CustomModelsManager(); }); Caching Related Records ----------------------- When a related record is queried, the ORM internally builds the appropiate condition and gets the required records using find/findFirst in the target model according to the following table: +---------------------+---------------------------------------------------------------------------------------------------------------+ | Type | Description | Implicit Method | +=====================+===============================================================================================================+ | Belongs-To | Returns a model instance of the related record directly | findFirst | +---------------------+---------------------------------------------------------------------------------------------------------------+ | Has-One | Returns a model instance of the related record directly | findFirst | +---------------------+---------------------------------------------------------------------------------------------------------------+ | Has-Many | Returns a collection of model instances of the referenced model | find | +---------------------+---------------------------------------------------------------------------------------------------------------+ This means that when you get a related record you could intercept how these data are obtained by implementing the corresponding method: .. code-block:: php customer; // Invoices::findFirst('...'); //Same as above $customer = $invoice->getCustomer(); // Invoices::findFirst('...'); Accordingly, we could replace the findFirst method in the model Invoices and implement the cache we consider most appropriate: .. code-block:: php customer; //Assign it to the record $invoice->customer = $customer; $results[] = $invoice; } //Store the invoices in the cache + their customers self::_setCache($key, $results); return $results; } public function initialize() { // add relations and initialize other stuff } } Getting the invoices from the cache already obtains the customer data in just one hit, reducing the overall overhead of the operation. Note that this process can also be performed with PHQL following an alternative solution: .. code-block:: php getModelsManager()->executeQuery($phql); $query->setCache(array( "key" => self::_createKey($conditions, $params), "lifetime" => 300 )); return $query->execute($params); } } Caching based on Conditions --------------------------- In this scenario, the cache is implemented conditionally according to current conditions received. According to the range where the primary key is located we choose a different cache backend: +---------------------+--------------------+ | Type | Cache Backend | +=====================+====================+ | 1 - 10000 | mongo1 | +---------------------+--------------------+ | 10000 - 20000 | mongo2 | +---------------------+--------------------+ | > 20000 | mongo3 | +---------------------+--------------------+ The easiest way is adding an static method to the model that chooses the right cache to be used: .. code-block:: php = 1 && $final < 10000) { return self::find(array( 'id >= ' . $initial . ' AND id <= '.$final, 'cache' => array('service' => 'mongo1') )); } if ($initial >= 10000 && $final <= 20000) { return self::find(array( 'id >= ' . $initial . ' AND id <= '.$final, 'cache' => array('service' => 'mongo2') )); } if ($initial > 20000) { return self::find(array( 'id >= ' . $initial, 'cache' => array('service' => 'mongo3') )); } } } This approach solves the problem, however, if we want to add other parameters such orders or conditions we would have to create a more complicated method. Additionally, this method does not work if the data is obtained using related records or a find/findFirst: .. code-block:: php 100 AND type = "A"'); $robots = Robots::find('(id > 100 AND type = "A") AND id < 2000'); $robots = Robots::find(array( '(id > ?0 AND type = "A") AND id < ?1', 'bind' => array(100, 2000), 'order' => 'type' )); To achieve this we need to intercept the intermediate representation (IR) generated by the PHQL parser and thus customize the cache everything possible: The first is create a custom builder, so we can generate a totally customized query: .. code-block:: php getPhql()); $query->setDI($this->getDI()); return $query; } } Instead of directly returning a Phalcon\\Mvc\\Model\\Query, our custom builder returns a CustomQuery instance, this class looks like: .. code-block:: php parse(); //Check if the query has conditions if (isset($ir['where'])) { //The fields in the conditions can have any order //We need to recursively check the conditions tree //to find the info we're looking for $visitor = new CustomNodeVisitor(); //Recursively visits the nodes $visitor->visit($ir['where']); $initial = $visitor->getInitial(); $final = $visitor->getFinal(); //Select the cache according to the range //... //Check if the cache has data //... } //Execute the query $result = $this->_executeSelect($ir, $params, $types); //cache the result //... return $result; } } Implementing a helper (CustomNodeVisitor) that recursively checks the conditions looking for fields that tell us the possible range to be used in the cache: .. code-block:: php visit($node['left']); $right = $this->visit($node['right']); if (!$left || !$right) { return false; } if ($left=='id') { if ($node['op'] == '>') { $this->_initial = $right; } if ($node['op'] == '=') { $this->_initial = $right; } if ($node['op'] == '>=') { $this->_initial = $right; } if ($node['op'] == '<') { $this->_final = $right; } if ($node['op'] == '<=') { $this->_final = $right; } } break; case 'qualified': if ($node['name'] == 'id') { return 'id'; } break; case 'literal': return $node['value']; default: return false; } } public function getInitial() { return $this->_initial; } public function getFinal() { return $this->_final; } } Finally, we can replace the find method in the Robots model to use the custom classes we've created: .. code-block:: php from(get_called_class()); if (isset($parameters['bind'])) { return $builder->getQuery()->execute($parameters['bind']); } else { return $builder->getQuery()->execute(); } } } Caching of PHQL planning ------------------------ As well as most moderns database systems PHQL internally caches the execution plan, if the same statement is executed several times PHQL reuses the previously generated plan improving performance, for a developer to take better advantage of this is highly recommended build all your SQL statements passing variable parameters as bound parameters: .. code-block:: php modelsManager->executeQuery($phql); //... } In the above example, ten plans were generated increasing the memory usage and processing in the application. Rewriting the code to take advantage of bound parameters reduces the processing by both ORM and database system: .. code-block:: php modelsManager->executeQuery($phql, array($i)); //... } Performance can be also improved reusing the PHQL query: .. code-block:: php modelsManager->createQuery($phql); for ($i = 1; $i <= 10; $i++) { $robots = $query->execute($phql, array($i)); //... } Execution plans for queries involving `prepared statements`_ are also cached by most database systems reducing the overall execution time, also protecting your application against `SQL Injections`_. .. _`prepared statements` : http://en.wikipedia.org/wiki/Prepared_statement .. _`SQL Injections` : http://en.wikipedia.org/wiki/SQL_injection