Sciweavers

1039 search results - page 120 / 208
» Query reformulation with constraints
Sort
View
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
16 years 5 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
178
Voted
SUM
2010
Springer
15 years 3 months ago
Cost-Based Query Answering in Action Probabilistic Logic Programs
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
167
Voted
ICDCS
2009
IEEE
15 years 2 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
ICASSP
2011
IEEE
14 years 8 months ago
Integrating frame-based and segment-based dynamic time warping for unsupervised spoken term detection with spoken queries
Rapidly increasing quantities of multimedia and spoken content today demand fast and accurate retrieval approaches for convenient browsing. The spoken documents with wide variety ...
Chun-an Chan, Lin-Shan Lee
169
Voted
SEMWEB
2001
Springer
15 years 9 months ago
Utilizing Host-Formalisms to Extend RDF-Semantics
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
Wolfram Conen, Reinhold Klapsing