Sciweavers

3471 search results - page 177 / 695
» Data Stream Query Processing
Sort
View
DAWAK
2010
Springer
15 years 27 days ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 3 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
IDEAS
1997
IEEE
107views Database» more  IDEAS 1997»
15 years 4 months ago
Query Processing in the ROL system
The ROL system is a novel deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language fo...
Mengchi Liu, Weidong Yu
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
15 years 6 months ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
IS
2007
14 years 11 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...