721 search results - page 19 / 145 » Supporting top-k join queries in relational databases |
DBVIS
1993
15 years 1 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
DAMON
2009
Springer
15 years 4 months ago
2009
Springer
By leveraging modern networking hardware (RDMA-enabled network cards), we can shift priorities in distributed database processing significantly. Complex and sophisticated mechani...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
185
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
95
Voted
CIKM
1994
Springer
15 years 1 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...