Sciweavers

179 search results - page 3 / 36
» Spatial Data Mining: Database Primitives, Algorithms and Eff...
Sort
View
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 5 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
VLDB
2000
ACM
136views Database» more  VLDB 2000»
13 years 9 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
KDD
1995
ACM
67views Data Mining» more  KDD 1995»
13 years 9 months ago
A Perspective on Databases and Data Mining
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
Marcel Holsheimer, Martin L. Kersten, Heikki Manni...
DAGM
1999
Springer
13 years 9 months ago
Knowledge Discovery in Spatial Databases
Both, the number and the size of spatial databases, such as geographic or medical databases, are rapidly growing because of the large amount of data obtained from satellite images,...
Martin Ester, Hans-Peter Kriegel, Jörg Sander
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 6 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...