Sciweavers

383 search results - page 15 / 77
» Join operations in temporal databases
Sort
View
155
Voted
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 9 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
TOOLS
1999
IEEE
15 years 1 months ago
Optimizing Object-Oriented Collection Join Queries through Path Traversals
Path traversals have been recognized as one of the strengths of object-oriented query processing as object retrieval can be carried out through pointer navigation. Apart from path...
David Taniar
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
15 years 3 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 2 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
15 years 11 months ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...