How to Install and Uninstall dbh-devel Package on openSuSE Tumbleweed
Last updated: November 26,2024
1. Install "dbh-devel" package
This guide let you learn how to install dbh-devel on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
dbh-devel
Copied
2. Uninstall "dbh-devel" package
Please follow the guidelines below to uninstall dbh-devel on openSuSE Tumbleweed:
$
sudo zypper remove
dbh-devel
Copied
3. Information about the dbh-devel package on openSuSE Tumbleweed
Information for package dbh-devel:
----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : dbh-devel
Version : 5.0.22-2.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.4 MiB
Installed : No
Status : not installed
Source package : dbh-5.0.22-2.1.src
Upstream URL : https://www.gnu.org/software/libdbh/
Summary : Development files for the Disk-Based Hash Library
Description :
Disk-based hashes is a method to create multidimensional binary trees
on disk. This library permits the extension of the database concept to
a plethora of electronic data, such as graphic information. With the
multidimensional binary tree, it is possible to mathematically prove
that access time to any particular record is minimized (using the
concept of critical points from calculus), which provides the means to
construct optimized databases for particular applications.
----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : dbh-devel
Version : 5.0.22-2.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.4 MiB
Installed : No
Status : not installed
Source package : dbh-5.0.22-2.1.src
Upstream URL : https://www.gnu.org/software/libdbh/
Summary : Development files for the Disk-Based Hash Library
Description :
Disk-based hashes is a method to create multidimensional binary trees
on disk. This library permits the extension of the database concept to
a plethora of electronic data, such as graphic information. With the
multidimensional binary tree, it is possible to mathematically prove
that access time to any particular record is minimized (using the
concept of critical points from calculus), which provides the means to
construct optimized databases for particular applications.