Sciweavers

2070 search results - page 55 / 414
» Querying Communities in Relational Databases
Sort
View
84
Voted
AI
2011
Springer
14 years 6 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
106
Voted
LWA
2004
15 years 9 days ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
82
Voted
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
15 years 4 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...
121
Voted
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 1 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
82
Voted
PVLDB
2010
174views more  PVLDB 2010»
14 years 9 months ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum