Sciweavers

306 search results - page 52 / 62
» Spark: top-k keyword query in relational databases
Sort
View
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
ICAIL
1999
ACM
13 years 12 months ago
Generating exception structures for legal information serving
More and more legal information is available in electronic form, but traditional retrieval mechanisms are insufficient to answer questions and legal problems of most users. In the...
Radboud Winkels, D. J. B. Bosscher, A. W. F. Boer,...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 10 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
WWW
2008
ACM
14 years 8 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti