Sciweavers

12519 search results - page 2284 / 2504
» Approximation Problems Categories
Sort
View
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 5 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 5 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
16 years 5 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
16 years 5 months ago
Boosting topic-based publish-subscribe systems with dynamic clustering
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
Tova Milo, Tal Zur, Elad Verbin
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 5 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
« Prev « First page 2284 / 2504 Last » Next »