Sciweavers

6974 search results - page 85 / 1395
» Querying Semi-Structured Data
Sort
View
EDBT
2009
ACM
104views Database» more  EDBT 2009»
13 years 5 months ago
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
A typical online Business Intelligence (BI) workload consists of a combination of short, less intensive queries, along with long, resource intensive queries. As such, the longest ...
Chetan Gupta, Abhay Mehta, Song Wang, Umeshwar Day...
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 8 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
SEMWEB
2009
Springer
14 years 2 months ago
Executing SPARQL Queries over the Web of Linked Data
The Web of Linked Data forms a single, globally distributed dataspace. Due to the openness of this dataspace, it is not possible to know in advance all data sources that might be r...
Olaf Hartig, Christian Bizer, Johann Christoph Fre...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
WWW
2003
ACM
14 years 8 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth