Sciweavers

12 search results - page 1 / 3
» Efficient Processing of Joins on Set-valued Attributes
Sort
View
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 4 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
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
12 years 8 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
CIKM
2006
Springer
13 years 8 months ago
A combination of trie-trees and inverted files for the indexing of set-valued attributes
Set-valued attributes frequently occur in contexts like marketbasked analysis and stock market trends. Late research literature has mainly focused on set containment joins and dat...
Manolis Terrovitis, Spyros Passas, Panos Vassiliad...
VLDB
1989
ACM
104views Database» more  VLDB 1989»
13 years 8 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
ISPAN
2002
IEEE
13 years 9 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar