Sciweavers

2859 search results - page 40 / 572
» Querying Complex Structured Databases
Sort
View
AIIA
2007
Springer
14 years 2 months ago
English Querying over Ontologies: E-QuOnto
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
Raffaella Bernardi, Francesca Bonin, Diego Calvane...
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
14 years 8 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
VLDB
1997
ACM
165views Database» more  VLDB 1997»
14 years 2 days ago
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...
Roy Goldman, Jennifer Widom
PODS
2001
ACM
145views Database» more  PODS 2001»
14 years 8 months ago
Optimization of Sequence Queries in Database Systems
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
Reza Sadri, Carlo Zaniolo, Amir M. Zarkesh, Jafar ...
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 9 months ago
A Data Structure for Sponsored Search
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...
Arnd Christian König, Kenneth Ward Church, Ma...