2223 search results - page 394 / 445 » Query Optimization in an OODBMS |
219
Voted
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
141
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
105
Voted
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Using a notebook to sketch designs, reflect on a topic, or capture and extend creative ideas are examples of active note taking tasks. Optimal experience for such tasks demands co...
217
Voted
VLDB
2002
ACM
16 years 3 months ago
2002
ACM
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
227
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...