Sciweavers

7576 search results - page 1291 / 1516
» On Querying Ontologies and Databases
Sort
View
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
16 years 1 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...
EDBT
2009
ACM
136views Database» more  EDBT 2009»
16 years 1 months ago
Rule-based multi-query optimization
Data stream management systems usually have to process many long-running queries that are active at the same time. Multiple queries can be evaluated more efficiently together tha...
Mingsheng Hong, Mirek Riedewald, Christoph Koch, J...
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 22 days ago
IndeGS: Index Supported Graphics Data Server for CFD Data Postprocessing
Virtual reality techniques particularly in the field of CFD (computational fluid dynamics) are of growing importance due to their ability to offer comfortable means to interact...
Christoph Brochhaus, Thomas Seidl
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
16 years 20 days ago
Distributing Google
We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of searc...
Vijay Gopalakrishnan, Bobby Bhattacharjee, Peter J...
« Prev « First page 1291 / 1516 Last » Next »