Mining frequent intemsets in memory-resident databases
2000-12-05
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(erimrs20001205144338.pdf, 0.2MB) |
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.
Keywords
Classifications using
Journal of Economic Literature (JEL) Classification System
- C89 : Data Collection and Data Estimation Methodology; Computer Programs: Other
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- management
- research
- marketing
- system
- business
- van den bosch
- series
- report
- philip hans franses
- performance
- frans a.j
- knowledge
- hendrikse
- george
- database
- classification
- van riel
- van bruggen
- theo e
- philip
