Sciweavers

2070 search results - page 111 / 414
» Querying Communities in Relational Databases
Sort
View
VLDB
1999
ACM
127views Database» more  VLDB 1999»
15 years 3 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 2 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 4 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
15 years 11 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
ICDE
2004
IEEE
85views Database» more  ICDE 2004»
16 years 15 days ago
Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivit...
Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano