Results 1 - 10
of
146
Estimating Answer Sizes for XML Queries
- In Proceedings of the 8th International Conference on Extending Database Technology (EDBT
, 2002
"... Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimization. Even at the user level, predictions of the total result size can be valuable in “next-step ” decisions, such as ..."
Abstract
-
Cited by 59 (9 self)
- Add to MetaCart
and robust estimates can be achieved, with limited space, and at a miniscule computational cost. These techniques have been implemented in the context of the TIMBER native XML database [22] at the University of Michigan. 1
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
A Survey of the Semantic Specification of Sensors
"... Abstract. Semantic sensor networks use declarative descriptions of sen-sors promote reuse and integration, and to help solve the difficulties of installing, querying and maintaining complex, heterogeneous sensor net-works. This paper reviews the state of the art for the semantic specifi-cation of se ..."
Abstract
- Add to MetaCart
Abstract. Semantic sensor networks use declarative descriptions of sen-sors promote reuse and integration, and to help solve the difficulties of installing, querying and maintaining complex, heterogeneous sensor net-works. This paper reviews the state of the art for the semantic specifi-cation
22.10.2009 Implementation of a Peer-to-Peer Multiplayer Game with Realtime Requirements
"... Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online role-playing games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games are ..."
Abstract
- Add to MetaCart
serious alternative. This work analyzes the implementation of both a client-server and a peer-to-peer networking model for the prototype shooter game Planet π4. Initially, a survey introduces recent academic approaches to peer-to-peer systems specifically designed for games. Of those, one system
DOI 10.1007/s00778-012-0302-x SPECIAL ISSUE PAPER Automating the database schema evolution process
"... Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy applicati ..."
Abstract
- Add to MetaCart
Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 841–848 ISBN 978-83-60810-22-4 Decomposition of SBQL Queries for Optimal Result Caching
"... Abstract—We present a new approach to optimization of query languages using cached results of previously evaluated queries. It is based on the stack-based approach (SBA) which assumes descriptionofsemanticsintheformofabstractimplementationof query/programming language constructs. Pragmatic universal ..."
Abstract
- Add to MetaCart
universality of object-oriented query language SBQL and its precise, formal operational semantics make it possible to investigate various crucial issues related to this kind of optimization. There are two main issues concerning this topic- the first is strategy for fast retrieval and high reuse of cached
1WEIGHTED PARTONOMY-TAXONOMY TREES WITH LOCAL SIMILARITY MEASURES FOR SEMANTIC BUYER-SELLER MATCH-MAKING
"... A semantically enhanced weighted tree similarity algorithm for buyer-seller match-making is presented. First, our earlier global, structural similarity measure over (product) partonomy trees is enriched by taxonomic semantics: Inner nodes can be labeled by classes whose partial subsumption order is ..."
Abstract
- Add to MetaCart
-purpose similarity measure realising the semantics to be invoked when computing the similarity of any two of its instances. We illustrate local similarity measures with e-Business types such as “Currency”, “Address”, “Date”, and “Price”. For example, the similarity measure on “Date”-typed leaf node labels translates
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties.
Results 1 - 10
of
146