Sciweavers

1544 search results - page 9 / 309
» Data Mining and Database Systems: Where is the Intersection
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 11 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
IJIS
2007
97views more  IJIS 2007»
13 years 7 months ago
Attribute-oriented fuzzy generalization in proximity- and similarity-based relational database systems
article we investigate an attribute-oriented induction approach for acquisition of abstract knowledge from data stored in a fuzzy database environment. We utilize a proximity-based...
Rafal A. Angryk, Frederick E. Petry
KDD
1997
ACM
111views Data Mining» more  KDD 1997»
13 years 11 months ago
SIPping from the Data Firehose
When mining large databases, the data extraction problem and the interface between the database and data mining algorithm become important issues. Rather than giving a mining algo...
George H. John, Brian Lent
BMCBI
2008
208views more  BMCBI 2008»
13 years 7 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
DEBU
2010
129views more  DEBU 2010»
13 years 4 months ago
Flash in a DBMS: Where and How?
Over the past decade, new solid state storage technologies, with flash being the most mature one, have become increasingly popular. Such technologies store data durably, and can a...
Manos Athanassoulis, Anastasia Ailamaki, Shimin Ch...