Sciweavers

2223 search results - page 278 / 445
» Query Optimization in an OODBMS
Sort
View
ALT
2009
Springer
16 years 1 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CIKM
2009
Springer
15 years 11 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
WWW
2010
ACM
15 years 11 months ago
Actively predicting diverse search intent from user browsing behaviors
This paper is concerned with actively predicting search intent from user browsing behavior data. In recent years, great attention has been paid to predicting user search intent. H...
Zhicong Cheng, Bin Gao, Tie-Yan Liu
ICDE
2005
IEEE
121views Database» more  ICDE 2005»
16 years 5 months ago
Full-fledged Algebraic XPath Processing in Natix
We present the first complete translation of XPath into an algebra, paving the way for a comprehensive, state-of-theart XPath (and later on, XQuery) compiler based on algebraic op...
Matthias Brantner, Sven Helmer, Carl-Christian Kan...
135
Voted
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
15 years 10 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr