1429 search results - page 139 / 286 » Efficient processing of XPath queries using indexes |
152
click to vote
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
132
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
166
click to vote
PODS
1998
ACM
15 years 7 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
132
click to vote
XSYM
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
142
Voted
PVLDB
2010
14 years 10 months ago
2010
The ever-increasing number of intrusions in public and commercial networks has created the need for high-speed archival solutions that continuously store streaming network data to...