Sciweavers

505 search results - page 29 / 101
» Approximate databases: a support tool for approximate reason...
Sort
View
CP
2009
Springer
14 years 2 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 6 days 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...
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 9 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
APSEC
2000
IEEE
14 years 9 days ago
A comparative evaluation of techniques for syntactic level source code analysis
Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, ...
Anthony Cox, Charles L. A. Clarke
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 8 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan