Sciweavers

709 search results - page 57 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 10 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 6 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
15 years 10 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...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 7 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
16 years 7 months ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande