Sciweavers

613 search results - page 31 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
15 years 8 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
WWW
2005
ACM
16 years 2 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
15 years 5 months ago
XMorph: A Shape-Polymorphic, Domain-Specific XML Data Transformation Language
By imposing a single hierarchy on data, XML makes queries brittle in the sense that a query might fail to produce the desired result if it is executed on the same data organized in...
Curtis Dyreson, Sourav S Bhowmick, Aswani Rao Jann...
ICDCS
2005
IEEE
15 years 7 months ago
Similarity Searching in Peer-to-Peer Databases
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
CIKM
2005
Springer
15 years 7 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan