Sciweavers

301 search results - page 25 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
VLDB
2001
ACM
157views Database» more  VLDB 2001»
15 years 11 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
169
Voted
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
15 years 11 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
80
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 5 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 11 days ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
16 years 11 days ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande