Sciweavers

721 search results - page 3 / 145
» Supporting top-k join queries in relational databases
Sort
View
JCIT
2010
174views more  JCIT 2010»
13 years 16 days ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
SIGMOD
2003
ACM
209views Database» more  SIGMOD 2003»
14 years 5 months ago
Distributed Top-K Monitoring
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumenta...
Brian Babcock, Chris Olston
CIKM
2011
Springer
12 years 5 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
13 years 10 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
VLDB
1994
ACM
99views Database» more  VLDB 1994»
13 years 9 months ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han