301 search results - page 38 / 61 » Efficient Sketches for the Set Query Problem |
DMDW
2000
15 years 11 days ago
2000
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
196
click to vote
ICDE
2006
IEEE
16 years 11 days ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
90
Voted
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
PODS
2005
ACM
15 years 11 months ago
2005
ACM
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
174
Voted
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...