Search Results for "searching system with algorithm in java"

Easy-to-use multi-platform disk cataloguing program supporting local or removable media - drives and folders. Uses XML files as a data storage. It was originally created in 2010 to catalogue software compilations (also called freeware compilations) and CDs distributed with computer magazines. It was later improved to support any kind of disk and folder. It can be used to catalogue fragile disks like CDs, floppies, external hard drives, usb sticks, memory cards which are easy to damage....

The goal of DynaQ is to develop an inquiry system to explore the personal information space, supporting you with the searching paradigm 'orienteering'. DynaQ is a (desktop)search engine with enhanced functionality for file, email and blog search. Look at our GitLab homepage for sourcecode and documentation: http://dynaq.opendfki.de

If you have ever tried to locate files, classes, and resources buried amongst an ever shifting locus of ZIP and / or JAR files, we feel your pain! After spending far too much time searching hundreds of archives for moving targets, I decided to write JarOMine. Originally designed for locating Java classes, JarOMine works equally well with ZIP archives, too.

Duplicate Files Searcher is an application for searching and deleting duplicate files on your computer. It is a platform-independent application.

SecureJDMS is the attempt to develop a secure DMS, based on an RCP and (even untrusted) DB for data storage. For now, its all about managing scanned documents and searching them by content (using OCR). All data sent and stored will be strongly encrypted.

Duplicate Files Searcher is an application for searching and deleting duplicate files on your computer. It is a platform-independent application.

The GIS Metadata Manager is a simple Java-based desktop application to manage files from geographic information systems (GIS) in a specified directory by grouping files into records, adding metadata and searching the metadata to find files.

The project will develop an in – memory object cache utilizing the LRU (least-recently-used) algorithm. The cache will store the objects that are most accessed within a fixed size memory pool. Thus system is keep statistics and calculates tradeoffs.