Sciweavers

190 search results - page 27 / 38
» Discovering XML keys and foreign keys in queries
Sort
View
WEBI
2009
Springer
15 years 4 months ago
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...
87
Voted
SBBD
2004
128views Database» more  SBBD 2004»
14 years 10 months ago
Integrating Heterogeneous Data Sources in Flexible and Dynamic Environments
Flexible and dynamic environments are characterized by high independence from connection participants, low control over available services and high tolerance to communication fail...
Angelo Brayner, Marcelo Meirelles
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 6 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CCR
2004
89views more  CCR 2004»
14 years 9 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron
PVLDB
2010
103views more  PVLDB 2010»
14 years 7 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...