{"id":1677,"date":"2019-08-18T09:29:28","date_gmt":"2019-08-18T03:59:28","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=1677"},"modified":"2019-08-18T10:28:59","modified_gmt":"2019-08-18T04:58:59","slug":"using-berkeley-db-with-sicstus-prolog","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2019\/08\/18\/using-berkeley-db-with-sicstus-prolog\/","title":{"rendered":"Using Berkeley DB with Sicstus Prolog"},"content":{"rendered":"

One of the nice features of Sicstus Prolog<\/strong><\/em><\/a>\u00a0is the support for storing Terms<\/strong><\/em>\u00a0externally in a Berkeley DB<\/strong><\/em><\/a>\u00a0database. Since we can control how the terms are indexed in the database, it is possible to store and retrieve a large amount of Terms\u00a0<\/strong><\/em>(the limit is 2^32-1<\/strong><\/em>) fairly efficiently. This can be useful when we work in a memory-constrained environment. The interface to Berkeley DB<\/strong><\/em> is provided by the library “bdb”.<\/strong><\/em><\/p>\n

As a matter of interest, the Prolog<\/strong><\/em> version of my “iLexicon”<\/strong><\/em><\/a> words database currently contains 2,453,333<\/strong><\/em> facts (close to 2.5 million<\/strong><\/em>) and Sicstus Prolog<\/strong><\/em> loads this entire data in 4 seconds<\/strong><\/em> flat! Of course, I have 32 GB RAM on my machine and that can explain the good performance. Therefore, as of now I have not felt the need to use Berkeley DB<\/strong><\/em> as the backend, but who knows, it might come in handy later on.<\/p>\n

In today’s article, I want to explore the BDB<\/strong><\/em> library. For more details, you may want to consult the Sicstus Prolog<\/strong><\/em> manual<\/strong><\/em><\/a>.<\/p>\n

My Prolog environment: Sicstus Prolog 4.5.1, 64 bit Windows edition.<\/strong>\u00a0<\/span><\/span><\/p><\/blockquote>\n

It is important to note that the current version of Sicstus Prolog<\/strong><\/em> only supports Berkeley DB version 6.2.38<\/strong><\/em><\/a>. So I had to download this version and install on my Windows<\/strong><\/em> machine in order to use the BDB<\/strong><\/em> library.<\/p>\n

Creating a new database<\/h3>\n

To create a new database, we have to give it a “name”<\/strong><\/em> and also mention the various “functors”<\/strong><\/em> and their respective\u00a0indexing<\/strong><\/em> specifications. Additionally, the DB must be opened in “update”<\/strong><\/em> mode. In this case, the BDB<\/strong><\/em> engine creates a directory with the same name in the current working directory. In my example, instead of storing one fact at a time, I am going to read facts from an existing Prolog<\/strong><\/em> file and store them in the database.<\/p>\n

Here are the facts (stored in the file “remedies.pro”<\/strong><\/em>):<\/p>\n

\"Sample<\/a>
Sample Facts about Homeo Remedies<\/strong><\/figcaption><\/figure>\n

Here is the code to create a new Berkeley DB<\/strong><\/em> and populate it with the facts from the given file:<\/p>\n

\"Code<\/a>
Code to Create the DB<\/strong><\/figcaption><\/figure>\n

As the code above shows, after the database is created and populated with sample data, it is closed immediately.<\/p>\n

The above predicate is executed in Sicstus Prolog<\/strong><\/em> IDE thus:<\/p>\n

\"Creating<\/a>
Creating the DB<\/strong><\/figcaption><\/figure>\n

If you look at the third argument, you can see the indexing specification of the various functors. The “+”<\/strong><\/em> denotes that the corresponding argument is to be indexed. In the case of “abbrev”<\/strong><\/em> functor, we have separately indexed both the arguments and there is also an un-indexed version. The latter is required if we decide to retrieve all matches of “abbrev”<\/strong><\/em> without specifying the arguments (i.e., non-ground, e.g. abbrev(X, Y)<\/strong><\/em> ).<\/p>\n

Updating the database<\/h3>\n

When we update an existing database, for example, by adding a new fact, the database must be opened in ‘<\/strong>update’<\/strong><\/em> mode and more importantly, we have to again supply the same predicate specification we gave at the time of creating. The latter looks like an avoidable repetition, but it is needed.<\/p>\n

Here is the code to update:<\/p>\n

\"Code<\/a>
Code to Update<\/strong><\/figcaption><\/figure>\n

It is executed as follows:<\/p>\n

\"Executing<\/a>
Executing Update in the IDE<\/strong><\/figcaption><\/figure>\n

This adds a new fact abbrev(‘acon.’, ‘aconitum napellus’)<\/strong><\/em><\/span> into the DB. As in the earlier case, this operation closes the DB after update. This is not optimal if we want to add many facts to the DB at the same time, but it is easy to extend the code to handle that case.<\/p>\n

Opening in ‘read’ mode<\/h3>\n

If we do not need to add or delete entries from the DB, we can safely open it in ‘read’<\/strong><\/em> mode. In practice, after opening the DB, we might perform several operations before closing it at the end. In such a situation, it is a good idea to assert<\/strong><\/em> the DB handle in the current working memory so that it is available for subsequent operations. Here is the code to illustrate this:<\/p>\n

\"Opening<\/a>
Opening in ‘read’ Mode<\/strong><\/figcaption><\/figure>\n

The above predicate uses the functor ‘dbinfo’<\/strong><\/em> to remember the current DB name and its handle. You can also see that I am not passing the original indexing specification here; it is not needed in ‘read’<\/strong><\/em> mode.<\/p>\n

Fetching one or more facts<\/h3>\n

Once the DB is open for reading, we can retrieve matching terms based on unification. Here is a simple predicate for doing that:<\/p>\n

\"Retrieving<\/a>
Retrieving Facts<\/strong><\/figcaption><\/figure>\n

We can use this predicate in our remedies database to look for all abbreviations:<\/p>\n

\"Fetching<\/a>
Fetching Terms<\/strong><\/figcaption><\/figure>\n

Notice how the predicate can backtrack to return multiple bindings for X<\/strong><\/em> and Y<\/strong><\/em>. This is made possible by the indexing specification “abbrev(-,-)”<\/strong><\/em>. Let us see what happens when we try this with the “group” functor:<\/strong><\/em><\/p>\n

\"Index<\/a>
Index Specification Mismatch<\/strong><\/figcaption><\/figure>\n

If you recall, the index specification in this case is “group(+,-)”<\/strong><\/em>, which says that the first argument must be grounded because it is used for indexing. Since we supplied a variable<\/strong><\/em> as the first argument, the fetch operation could not succeed.<\/p>\n

The following, however, works:<\/p>\n

\"Satisfying<\/a>
Satisfying Index Specification<\/strong><\/figcaption><\/figure>\n

Iterating over all facts<\/h3>\n

Instead of fetching specific terms, we can also iterate over all (or select) items in the DB.<\/p>\n

\"Iterating<\/a>
Iterating Over the DB<\/strong><\/figcaption><\/figure>\n

The ‘traverse_db’<\/strong><\/em> predicate takes the DB name and another ‘Action’<\/strong> <\/em>predicate (which must take a single argument) and applies the ‘Action’<\/strong><\/em> on each item in the DB. The traversal order is not guaranteed<\/em>.<\/p>\n

Here is a use case:<\/p>\n

\"Iterating<\/a>
Example: Iterating Over the DB<\/strong><\/figcaption><\/figure>\n

Closing the DB<\/h3>\n

Once all database operations are complete, it is necessary to close the DB. Here is a predicate that does that:<\/p>\n

\"Closing<\/a>
Closing the DB<\/strong><\/figcaption><\/figure>\n

It uses the supplied DB name to look up the corresponding handle and then uses that handle to close the DB. In the process, it removes information about the current DB from the working memory.<\/p>\n

Exporting and Importing<\/h3>\n

The contents of a Berkeley DB<\/strong><\/em> can be exported to a text file. The predicate “db_export”<\/strong><\/em> does this. The exported file contains extra meta information about the database and is in Prolog<\/strong><\/em> format. This file can be “imported”<\/strong><\/em>, if needed, using the predicate “db_import”<\/strong><\/em>.<\/p>\n

One aspect of the database I have ignored is the “Environment”<\/strong><\/em>. This is optional and is only needed if multiple processes<\/strong><\/em> wish to share access to the same database. I urge you to go through the manual if you are interested to learn more about this.<\/p>\n

As you would have observed, using the BDB library<\/strong><\/em> to access an external Berkeley DB<\/strong><\/em> is quite intuitive in Sicstus Prolog.<\/strong><\/em> As hinted earlier, this feature will come in handy when working with a large fact base in a memory-limited environment.<\/p>\n

You can download my Prolog<\/strong><\/em> file here<\/strong><\/em><\/a>. The sample data is in this file<\/strong><\/em><\/a>.<\/p>\n

Have a nice weekend!<\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

One of the nice features of Sicstus Prolog\u00a0is the support for storing Terms\u00a0externally in a Berkeley DB\u00a0database. Since we can control how the terms are indexed in the database, it is possible to store and retrieve a large amount of Terms\u00a0(the limit is 2^32-1) fairly efficiently. This can be useful when we work in a […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[17,147],"tags":[214,151],"class_list":["post-1677","post","type-post","status-publish","format-standard","hentry","category-programming","category-prolog","tag-berkeley-db","tag-sicstus-prolog"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-r3","jetpack-related-posts":[{"id":2553,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/10\/03\/using-sicstus-prolog-with-lmdb\/","url_meta":{"origin":1677,"position":0},"title":"Using Sicstus Prolog with LMDB","author":"admin","date":"October 3, 2021","format":false,"excerpt":"In an earlier article, I showed how Sicstus Prolog allows us to use Berkeley DB for storage and retrieval of terms using the file system. Interestingly, the latest release of Sicstus Prolog, version 4.7.0, deprecates the Berekely DB library, while recommending an alternative implementation based on Lightning Memory-Mapped Database Manager\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"Facts About Homeopathic Remedies","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/10\/remedies-300x116.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":1025,"url":"https:\/\/www.rangakrish.com\/index.php\/2018\/08\/19\/sicstus-prolog-building-a-windows-executable\/","url_meta":{"origin":1677,"position":1},"title":"Sicstus Prolog – Building a Windows Executable","author":"admin","date":"August 19, 2018","format":false,"excerpt":"In my previous post, I showed how to build a C-based Windows DLL to execute Prolog predicates in the Sicstus Prolog\u00a0engine. Today, I want to show how to build an executable (on Windows) from a C\/C++ program that uses Sicstus prolog engine. The process is quite simple. In order to\u2026","rel":"","context":"In "Natural Language Processing"","block_context":{"text":"Natural Language Processing","link":"https:\/\/www.rangakrish.com\/index.php\/category\/natural-language-processing\/"},"img":{"alt_text":"Creating WordNet Prolog Image","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Creating-image.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Creating-image.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Creating-image.png?resize=525%2C300 1.5x"},"classes":[]},{"id":1004,"url":"https:\/\/www.rangakrish.com\/index.php\/2018\/08\/05\/sicstus-prolog-building-a-windows-dll\/","url_meta":{"origin":1677,"position":2},"title":"Sicstus Prolog – Building a Windows DLL","author":"admin","date":"August 5, 2018","format":false,"excerpt":"Last week I upgraded to the latest version (4.4.1) of Sicstus Prolog\u00a0for Windows.\u00a0Since the Prolog engine can be embedded (royalty free) in other applications, it is useful to understand how to create a DLL (on Windows) for this purpose. In today's article, I would like to outline this process in\u2026","rel":"","context":"In "C++"","block_context":{"text":"C++","link":"https:\/\/www.rangakrish.com\/index.php\/category\/c\/"},"img":{"alt_text":"Creating Prolog Program Image","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Saving-Prolog-Image.png?resize=350%2C200","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Saving-Prolog-Image.png?resize=350%2C200 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2018\/08\/Saving-Prolog-Image.png?resize=525%2C300 1.5x"},"classes":[]},{"id":1770,"url":"https:\/\/www.rangakrish.com\/index.php\/2019\/11\/10\/calling-c-methods-from-sicstus-prolog-through-com-interface\/","url_meta":{"origin":1677,"position":3},"title":"Calling C# Methods from Sicstus Prolog through COM Interface","author":"admin","date":"November 10, 2019","format":false,"excerpt":"Recently\u00a0I needed to make use of a C# library (which I had implemented a few years ago) from Sicstus Prolog. Calling C\/C++ functions from Sicstus Prolog is fairly well documented. When it comes to C#\/.NET, the official documentation recommends the PrologBeans library. After going through the documentation, I felt that\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"Prolog Client Code","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/Prolog-Code.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/Prolog-Code.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2019\/11\/Prolog-Code.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":3260,"url":"https:\/\/www.rangakrish.com\/index.php\/2023\/11\/26\/generating-polynomials-in-prolog\/","url_meta":{"origin":1677,"position":4},"title":"Generating Polynomials in Prolog","author":"admin","date":"November 26, 2023","format":false,"excerpt":"Polynomial is an important topic in High School maths curriculum. There are many online courses that explain the topic in great details with lots of examples and sample exercises. Wouldn\u2019t it be interesting if we can generate polynomials of given degree programmatically? It turns out that this is not such\u2026","rel":"","context":"In "Programming"","block_context":{"text":"Programming","link":"https:\/\/www.rangakrish.com\/index.php\/category\/programming\/"},"img":{"alt_text":"Generating Polynomials - Main Clauses","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/11\/Code1-300x163.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2366,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/03\/28\/implementing-ilexicon-using-litedb\/","url_meta":{"origin":1677,"position":5},"title":"Implementing iLexicon using LiteDB","author":"admin","date":"March 28, 2021","format":false,"excerpt":"iLexicon is an \"intelligent\" dictionary that can be used to build Natural Language applications. I have two implementations, one in Lisp and another in Prolog. Both implementations are memory-based, in order to speed up performance. I have written several articles referencing it, for example see this. \u00a0 LiteDB is a\u2026","rel":"","context":"In "Natural Language Processing"","block_context":{"text":"Natural Language Processing","link":"https:\/\/www.rangakrish.com\/index.php\/category\/natural-language-processing\/"},"img":{"alt_text":"Sample Commands","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/03\/Session1.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1677","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=1677"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/1677\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=1677"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=1677"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=1677"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}