2070 search results - page 122 / 414 » Regret-Minimizing Representative Databases |
116
click to vote
CINQ
2004
Springer
15 years 6 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
124
click to vote
ER
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
148
click to vote
EDBT
1992
ACM
15 years 4 months ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
117
click to vote
DASFAA
2007
IEEE
15 years 2 months ago
2007
IEEE
To support emerging database applications that deal with continuously changing (or moving) data objects (CCDOs), such as vehicles, RFIDs, and multi-stimuli sensors, one requires an...
115
click to vote
ICDE
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— Collected data often contains uncertainties. Probabilistic databases have been proposed to manage uncertain data. To combine data from multiple autonomous probabilistic...