Sciweavers

917 search results - page 146 / 184
» Mining interesting sets and rules in relational databases
Sort
View
ICDT
2010
ACM
180views Database» more  ICDT 2010»
14 years 5 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
ICDT
1995
ACM
79views Database» more  ICDT 1995»
13 years 11 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
EDBT
2009
ACM
195views Database» more  EDBT 2009»
14 years 2 months ago
Anonymizing moving objects: how to hide a MOB in a crowd?
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshm...
CIKM
2006
Springer
13 years 11 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...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei