Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
124,470
Using Parallel Semi-Join Reduction to Minimize Distributed Query Response Time
- IEEE International Conference on Algorithms and Architectures for Parallel Processing, IEEE CS
, 1995
"... A one-shot semi-join reduction approach was recently proposed to execute all semi-joins on the same relation simultaneously such that the relation only needs to be scanned once. The one-shot semi-join reduction approach was applied to reducing distributed query response time under the assumption tha ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
A one-shot semi-join reduction approach was recently proposed to execute all semi-joins on the same relation simultaneously such that the relation only needs to be scanned once. The one-shot semi-join reduction approach was applied to reducing distributed query response time under the assumption
A Survey on Query Response Time Optimization Approaches for Reliable Data Communication in Wireless Sensor Network
"... Wireless sensor network is an application specific network. There are various factors which affects reliability in Wireless Sensor Network some of them are energy consumption, high packet loss, congestion, and large response time. There are different parameters, which affects query response time. Wh ..."
Abstract
- Add to MetaCart
Wireless sensor network is an application specific network. There are various factors which affects reliability in Wireless Sensor Network some of them are energy consumption, high packet loss, congestion, and large response time. There are different parameters, which affects query response time
QoS control based on query response time prediction
- 9th WSEAS International Conference on Computers, Article No. 81
, 2005
"... Warehouse (DW)) is determined with a response time, availability, consistency and currency. In this paper we consider the influence of the system load and the system throughput on the response time, as well as a possibility of the accurate response time prediction- whereby that mechanism may be a fo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Warehouse (DW)) is determined with a response time, availability, consistency and currency. In this paper we consider the influence of the system load and the system throughput on the response time, as well as a possibility of the accurate response time prediction- whereby that mechanism may be a
Improving Computation Power by Reducing Query Response Time in Peer-to-Peer Environment
"... Abstract: Problem statement: The Peer-to-Peer (P2P) was an emerging model and was being widely adopted in today’s internet computing.P2P traffic contributes the largest portion of the internet traffic which was unnecessary and led to delay. In existing Scalable Bipartite Overlay (SBO) network, Out o ..."
Abstract
- Add to MetaCart
of “N ” peers, one group of peers were probing the messages (or) queries whereas the other group of peers were computing. This resulted in high query response time.Since the system was bipartite all peers were not capable of computing and probing, resulting in increased computation time. Approach
Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract
-
Cited by 497 (123 self)
- Add to MetaCart
of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial time data complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABox reasoning during query evaluation: the part of the process requiring
Answering queries using views
- In PODS Conference
, 1995
"... We consider the problem of computing answers to queries by using materialized views. Aside from its potential in optimizing query evaluation, the problem also arises in applications such as Global Information Systems, Mobile Computing and maintaining physical data independence. We consider the probl ..."
Abstract
-
Cited by 447 (32 self)
- Add to MetaCart
of deciding which literals from the original query can be deleted). We describe a polynomial time algorithm for nding rewritings, and show that under certain conditions, it will nd the minimal rewriting. Finally, we analyze the complexity of the problems when the queries and views may be disjunctive
Fast subsequence matching in time-series databases
- PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract
-
Cited by 533 (24 self)
- Add to MetaCart
We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature
An algorithm for finding best matches in logarithmic expected time
- ACM Transactions on Mathematical Software
, 1977
"... An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number of recor ..."
Abstract
-
Cited by 764 (2 self)
- Add to MetaCart
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number
Symbolic Model Checking for Real-time Systems
- INFORMATION AND COMPUTATION
, 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract
-
Cited by 578 (50 self)
- Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Implementing data cubes efficiently
- In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract
-
Cited by 548 (1 self)
- Add to MetaCart
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like
Results 1 - 10
of
124,470
