Sciweavers

6740 search results - page 317 / 1348
» Querying Databases with Taxonomies
Sort
View
PSSS
2003
15 years 8 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
ACL
2012
13 years 9 months ago
Entailment-based Text Exploration with Application to the Health-care Domain
We present a novel text exploration model, which extends the scope of state-of-the-art technologies by moving from standard concept-based exploration to statement-based exploratio...
Meni Adler, Jonathan Berant, Ido Dagan
280
Voted
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
16 years 7 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
ICDE
2005
IEEE
114views Database» more  ICDE 2005»
16 years 12 days ago
VAMANA - A Scalable Cost-Driven XPath Engine
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
Venkatesh Raghavan, Kurt W. Deschler, Elke A. Rund...
CIKM
2006
Springer
15 years 8 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler