Sciweavers

513 search results - page 11 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
INFOCOM
2003
IEEE
14 years 20 days ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 7 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
SEMWEB
2005
Springer
14 years 26 days ago
Containment and Minimization of RDF/S Query Patterns
Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extens...
Giorgos Serfiotis, Ioanna Koffina, Vassilis Christ...
ICMCS
2006
IEEE
153views Multimedia» more  ICMCS 2006»
14 years 1 months ago
RESP: Shortest-Path-Based Cache Replacement in a Transcoding Proxy
In this paper, we discuss the cache replacement policy in a multimedia transcoding proxy. Unlike the cache replacement for conventional web objects, to replace some elements with ...
Hao-Ping Hung, Ming-Syan Chen
ICDE
1998
IEEE
99views Database» more  ICDE 1998»
13 years 11 months ago
Query Folding with Inclusion Dependencies
Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, ...
Jarek Gryz