Sciweavers

513 search results - page 38 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 8 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
15 years 11 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
WWW
2006
ACM
15 years 10 months ago
Mining search engine query logs for query recommendation
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
Zhiyong Zhang, Olfa Nasraoui
ESWS
2008
Springer
14 years 11 months ago
Streaming SPARQL - Extending SPARQL to Process Data Streams
A lot of work has been done in the area of data stream processing. Most of the previous approaches regard only relational or XML based streams but do not cover semantically richer ...
Andre Bolles, Marco Grawunder, Jonas Jacobi
AAAI
2008
14 years 10 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor