Mining Frequent Intemsets in Memory-Resident Databases

Due to the present-day memory sizes, a memory-resident database has become a practical option. Consequently, new methods designed to mining in such databases are desirable. In the case of disk-resident databases, breadth-first search methods are commonly used. We propose a new algorithm, based upon depth-first search in a set-enumeration tree. For memory-resident databases, this method turns out to be superior to breadth-first search

MoreLess

Year of publication:	2011
Authors:	Pijls, Wim ; Bioch, Jan C.
Publisher:	[S.l.] : SSRN
Subject:	Data Mining \| Data mining \| Datenbank \| Database \| Bergbau \| Mining

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (16 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments December 5, 2000 erstellt
Classification:	R4 - Transportation Systems ; M11 - Production Management ; C89 - Data Collection and Data Estimation Methodology; Computer Programs. Other
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014092607