Sciweavers

87 search results - page 9 / 18
» Optimization and evaluation of shortest path queries
Sort
View
IDEAS
2010
IEEE
238views Database» more  IDEAS 2010»
13 years 5 months ago
An integrative approach to query optimization in native XML database management systems
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...
Andreas M. Weiner, Theo Härder
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 8 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 9 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 8 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
AINA
2008
IEEE
14 years 1 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...