Sciweavers

1768 search results - page 336 / 354
» Mining Very Large Databases
Sort
View
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 10 months ago
Augmented social cognition: using social web technology to enhance the ability of groups to remember, think, and reason
We are experiencing a new Social Web, where people share, communicate, commiserate, and conflict with each other. As evidenced by systems like Wikipedia, twitter, and delicious.co...
Ed H. Chi
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 10 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
14 years 10 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
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 10 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 10 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...