Sciweavers

148 search results - page 13 / 30
» Query Evaluation via Tree-Decompositions
Sort
View
ASWC
2009
Springer
13 years 10 months ago
Social Semantic Rule Sharing and Querying in Wellness Communities
In this paper we describe the Web 3.0 case study WellnessRules, where ontology-structured rules (including facts) about wellness opportunities are created by participants in rule l...
Harold Boley, Taylor Michael Osmun, Benjamin Larry...
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
14 years 7 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
DLOG
2011
12 years 11 months ago
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
Eufemia Tinelli, Francesco M. Donini, Michele Ruta...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...