Sciweavers

383 search results - page 7 / 77
» Join operations in temporal databases
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
15 years 9 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
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 1 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
16 years 9 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
15 years 9 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
DEBS
2007
ACM
15 years 1 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert