Sciweavers

10625 search results - page 1812 / 2125
» Supporting delay-intolerant applications
Sort
View
VLDB
2001
ACM
168views Database» more  VLDB 2001»
15 years 11 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
VLDB
2002
ACM
184views Database» more  VLDB 2002»
15 years 11 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
VLDB
2006
ACM
203views Database» more  VLDB 2006»
15 years 11 months ago
The CQL continuous query language: semantic foundations and query execution
CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registeri...
Arvind Arasu, Shivnath Babu, Jennifer Widom
VLDB
2006
ACM
207views Database» more  VLDB 2006»
15 years 11 months ago
Modeling and querying moving objects in networks
: Moving Objects Databases have become an important research issue in recent years. For and querying moving objects, there exists a comprehensive framework of abstract data types t...
Ralf Hartmut Güting, Victor Teixeira de Almeida, ...
VLDB
2007
ACM
107views Database» more  VLDB 2007»
15 years 11 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
« Prev « First page 1812 / 2125 Last » Next »