Sciweavers

621 search results - page 8 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
COOPIS
2002
IEEE
14 years 1 months ago
Efficient Querying of Distributed Resources in Mediator Systems
: This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making ...
Ioana Manolescu, Luc Bouganim, Françoise Fa...
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 10 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 8 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...