Sciweavers

491 search results - page 88 / 99
» Optimizing Large OODB Queries
Sort
View
SSDBM
2005
IEEE
122views Database» more  SSDBM 2005»
14 years 1 months ago
Detection and Tracking of Discrete Phenomena in Sensor-Network Databases
This paper introduces a framework for Phenomena Detection and Tracking (PDT, for short) in sensor network databases. Examples of detectable phenomena include the propagation over ...
Mohamed H. Ali, Mohamed F. Mokbel, Walid G. Aref, ...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 29 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
CPAIOR
2007
Springer
14 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
OTM
2007
Springer
14 years 1 months ago
Parallelizing Tableaux-Based Description Logic Reasoning
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
Thorsten Liebig, Felix Müller