294 search results - page 12 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
185
click to vote
ICDE
2007
IEEE
15 years 10 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...
PODS
2003
ACM
15 years 9 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
IQIS
2007
ACM
14 years 11 months ago
2007
ACM
Relational Database Systems often support activities like data warehousing, cleaning and integration. All these activities require performing some sort of data transformations. Si...
176
Voted
VLDB
2003
ACM
15 years 9 months ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
154
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
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...