Sciweavers

6974 search results - page 189 / 1395
» Querying Semi-Structured Data
Sort
View
JAIR
2012
254views Hardware» more  JAIR 2012»
11 years 10 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
VLDB
1994
ACM
84views Database» more  VLDB 1994»
14 years 9 days ago
A Multidatabase System for Tracking and Retrieval of Financial Data
We have built a multidatabase system to support a financial application that stores historical data used by traders to identify trends in the market. The application has an update...
Munir Cochinwala, John Bradley
DEBS
2011
ACM
12 years 11 months ago
DejaVu: a complex event processing system for pattern matching over live and historical data streams
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
Nihal Dindar, Peter M. Fischer, Nesime Tatbul
CIKM
2000
Springer
14 years 17 days ago
Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
Ratko Orlandic, Byunggu Yu
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 8 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...