The Enterprise channel covers all topics related to Linux and open-source within enterprise environments.
Hadoop is an Apache project to provide for reliable, scalable, distributed computing that's open-source.
PhpMyAdmin is a tool written in PHP for MySQL server database administration.
PostgeSQL is a leading open-source SQL database server.
Samba is an open-source SMB/CIFS protocol implementation for supporting interoperable file and print services from Windows on Linux/Unix systems.
Web servers and other server software projects are covered by this sub-channel.
All projects relating to virtualization and hypervisors are covered in this sub-channel.
This Week's Activity
- Fix nbtree metapage cache upgrade bug
PostgreSQL - Peter Geoghegan: Commit 857f9c36cda, which taught nbtree VACUUM to avoid unnecessary index scans, bumped the nbtree version number from 2 to 3, while adding the ability for nbtree indexes to be upgraded on-the-fly.
- ci: Update glib.supp file
SPICE - Frediano Ziglio: Sync with Glib master file.
- Remove unnecessary TYPECACHE_GT_OPR lookup
PostgreSQL - Tomas Vondra: The TYPECACHE_GT_OPR is not needed (it used to be in older version of the MCV code), but the compiler failed to detect this as the result was used in a fmgr_info() call, populating a FmgrInfo entry.
- gst:mjpeg do not set max-threads
SPICE - Uri Lublin
- s3/lib/smbconf: clang: 'Value stored during its initialization is never read'
Samba - Noel Power: Fixes:
- Clean up some ad-hoc code for sorting and de-duplicating Lists
PostgreSQL - Tom Lane: heap.c and relcache.c contained nearly identical copies of logic to insert OIDs into an OID list while preserving the list's OID ordering (and rejecting duplicates, in one case but not the other).
The comments argue that this is faster than qsort for small numbers of OIDs, which is at best unproven, and seems even less likely to be true now that lappend_cell_oid has to move data around.
- Represent Lists as expansible arrays, not chains of cons-cells
PostgreSQL - Tom Lane: Originally, Postgres Lists were a more or less exact reimplementation of Lisp lists, which consist of chains of separately-allocated cons cells, each having a value and a next-cell link.