Sciweavers

2635 search results - page 253 / 527
» Algorithms for the Database Layout Problem
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
16 years 1 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
CIKM
2009
Springer
16 years 1 months ago
Role of weak ties in link prediction of complex networks
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
Linyuan Lu, Tao Zhou
ICDT
2007
ACM
105views Database» more  ICDT 2007»
16 years 23 days ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 22 days ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
184
Voted
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 11 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo