Sciweavers

911 search results - page 53 / 183
» On the Distance of Databases
Sort
View
IS
2008
13 years 7 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
IAJIT
2010
95views more  IAJIT 2010»
13 years 6 months ago
Modelling of Updating Moving Object Database Using Timed Petri Net Model
: Tracking moving objects is one of the most common requirements for many location-based applications. The location of a moving object changes continuously but the database locatio...
Hatem Abdul-Kader, Warda El-Kholy
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 7 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
DBPL
2005
Springer
130views Database» more  DBPL 2005»
14 years 1 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 2 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao