Sciweavers

383 search results - page 52 / 77
» Join operations in temporal databases
Sort
View
DEBU
2008
118views more  DEBU 2008»
14 years 9 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
80
Voted
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 2 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
73
Voted
VLDB
2004
ACM
119views Database» more  VLDB 2004»
15 years 3 months ago
Supporting Ontology-Based Semantic matching in RDBMS
Ontologies are increasingly being used to build applications that utilize domain-specific knowledge. This paper addresses the problem of supporting ontology-based semantic matchin...
Souripriya Das, Eugene Inseok Chong, George Eadon,...
DEXA
2006
Springer
136views Database» more  DEXA 2006»
15 years 1 months ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen
MFDBS
1991
125views Database» more  MFDBS 1991»
15 years 1 months ago
A Relational Algebra for Complex Objects Based on Partial Information
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
Leonid Libkin