Sciweavers

4616 search results - page 630 / 924
» Beyond relational databases
Sort
View
ALT
2000
Springer
15 years 11 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
210
Voted
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 11 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
SIGMOD
1999
ACM
114views Database» more  SIGMOD 1999»
15 years 11 months ago
A Layered Architecture for Querying Dynamic Web Content
The design of webbases, database systems for supporting Webbased applications, is currently an active area of research. In this paper, we propose a 3-layer architecture for design...
Hasan Davulcu, Juliana Freire, Michael Kifer, I. V...
AGENTS
1999
Springer
15 years 11 months ago
Personal Navigating Agents
The World Wide Web provides a huge distributed web database. However, information in the web database is free formatted and unorganized. Traditional keyword-based retrieval approa...
H. L. Wang, W. K. Shih, C. N. Hsu, Y. S. Chen, Y. ...
ADBIS
1995
Springer
155views Database» more  ADBIS 1995»
15 years 10 months ago
The MaStA I/O Cost Model and its Validation Strategy
Crash recovery in database systems aims to provide an acceptable level of protection from failure at a given engineering cost. A large number of recovery mechanisms are known, and...
S. Scheuerl, Richard C. H. Connor, Ronald Morrison...