Sciweavers

4790 search results - page 48 / 958
» Reverse Query Processing
Sort
View
PODS
2004
ACM
98views Database» more  PODS 2004»
14 years 9 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
DAWAK
2006
Springer
14 years 15 days ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
GPCE
2004
Springer
14 years 2 months ago
Compiling Process Graphs into Executable Code
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
Rainer Hauser, Jana Koehler
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
WEBI
2007
Springer
14 years 2 months ago
Mapping Ontologies Elements using Features in a Latent Space
This paper proposes a method for the mapping of ontologies that, in a greater extent than other approaches, discovers and exploits sets of latent features for approximating the in...
Vassilis Spiliopoulos, George A. Vouros, Vangelis ...