Sciweavers

348 search results - page 17 / 70
» Database Support for Path Query Functions
Sort
View
VLDB
1989
ACM
150views Database» more  VLDB 1989»
13 years 11 months ago
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing p...
Elke A. Rundensteiner, Lubomir Bic
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 8 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
WEBDB
2004
Springer
80views Database» more  WEBDB 2004»
14 years 25 days ago
Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
CIKM
2009
Springer
14 years 2 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch