Sciweavers

587 search results - page 25 / 118
» Effective keyword search in relational databases
Sort
View
IADIS
2008
13 years 9 months ago
Aggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu
SIGMETRICS
2003
ACM
147views Hardware» more  SIGMETRICS 2003»
14 years 26 days ago
Effect of node size on the performance of cache-conscious B+-trees
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
Richard A. Hankins, Jignesh M. Patel
CIKM
2009
Springer
14 years 2 months ago
On domain similarity and effectiveness of adapting-to-rank
Adapting to rank address the the problem of insufficient domainspecific labeled training data in learning to rank. However, the initial study shows that adaptation is not always...
Keke Chen, Jing Bai, Srihari Reddy, Belle L. Tseng
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
PVLDB
2008
124views more  PVLDB 2008»
13 years 7 months ago
DBPubs: multidimensional exploration of database publications
DBPubs is a system for effectively analyzing and exploring the content of database publications by combining keyword search with OLAP-style aggregations, navigation, and reporting...
Akanksha Baid, Andrey Balmin, Heasoo Hwang, Erik N...