Sciweavers

610 search results - page 71 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
PODS
2000
ACM
120views Database» more  PODS 2000»
15 years 6 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 3 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
15 years 28 days ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 4 months ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
15 years 7 months ago
Performance Tradeoffs for Client-Server Query Processing
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
Michael J. Franklin, Björn Þór J...