Sciweavers

356 search results - page 2 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 5 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
PDIS
1994
IEEE
13 years 9 months ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 6 months ago
Integrating and Ranking Uncertain Scientific Data
Mediator-based data integration systems resolve exploratory queries by joining data elements across sources. In the presence of uncertainties, such multiple expansions can quickly ...
Landon Detwiler, Wolfgang Gatterbauer, Brenton Lou...
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 4 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis