1497 search results - page 181 / 300 » Online Negative Databases |
154
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
218
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Many kinds of real-life data exhibit logical ordering among their data items and are thus sequential in nature. However, traditional online analytical processing (OLAP) systems an...
246
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
112
click to vote
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distri...
113
click to vote
EDBT
2008
ACM
16 years 5 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...