Sciweavers

306 search results - page 39 / 62
» Mining tree queries in a graph
Sort
View
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 2 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
SAC
2006
ACM
14 years 1 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
14 years 23 days ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 2 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu