Sciweavers

329 search results - page 34 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
ISPAN
2002
IEEE
14 years 10 days ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
CINQ
2004
Springer
180views Database» more  CINQ 2004»
13 years 11 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 7 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau