Our Services

Combination Mobile Crushing Plant

Combination Mobile Crushing Plant

Compared with fixed production lines,Combination Mobile Crusher have a shorter engineering period and rapider transition, which not only reduces the investment risk and opportunity cost of the investors, but also avoids the demolition and construction

C6X Series Jaw Crusher

C6X Series Jaw Crusher

C6X Jaw Crusher on structure and production efficiency present advanced modern technologies. Our Company's C6X Jaw Crusher can solve such problems of the existing jaw crushers as low production efficiency, difficult installation and maintenance. At pr

HGT Hydraulic Gyratory Crusher

HGT Hydraulic Gyratory Crusher

HGT Gyratory Crusher is a new-type intelligent coarse crusher with big capacity and high efficiency. It integrates mechanical, hydraulic, electric, automated, and intelligent controlling technologies which grant it with advantages traditional crushing

European Type Jaw Crusher PEW

European Type Jaw Crusher PEW

Jaw crushers has stationary jaw crusher, portable jaw crusher and mobile jaw crusher (crawler jaw crusher). Jaw crusher (PEW Series) is not only able to be used together with mine-selecting and gravel processing equipments but also be used independen

VSI5X Vertical Shaft Impact Crusher

VSI5X Vertical Shaft Impact Crusher

VSI Crushers Working Principle Raw material falls down into feed hopper, and then enters rotor through central entrance hole. It is accelerated in high-speed rotor, and then is thrown out at speed of 60-75m/s. When hitting anvil, it is crushed. Final

VSI Vertical Shaft Impact Crusher

VSI Vertical Shaft Impact Crusher

VSI Series vertical shaft impact crusher is designed by reputed German expert of SBM and every index is in worlds leading standard. It incorporates three crushing types and it can be operated 720 hours continuously. Nowadays, VSI crusher has replaced

VUS aggregate optimization system

VUS aggregate optimization system

The VU system is a global most-advanced dry-process sand-making system. The system is constructed like a tower. Its fully-enclosed layout features high integration. It integrates the functions of high-efficiency sand making, particle shape optimizatio

MTW-Z European Trapezium Mill

MTW-Z European Trapezium Mill

MTW European Grinding Mill is innovatively designed through deep research on grinding mills and development experience. It absorbs the latest European powder grinding technology and concept, and combines the suggestions of 9158 customers on grinding m

5X Series Roller Grinding Mill

5X Series Roller Grinding Mill

Grinding roller of MB5X Pendulum Roller Grinding Mill l adopts diluted oil lubrication. It is a technology initiated domestically which is maintenance-free and easy to operate. Diluted oil lubrication is oil bath lubrication, more convenient than grea

MTW Trapezium Mill

MTW Trapezium Mill

MTW European Grinding Mill is innovatively designed through deep research on grinding mills and development experience. It absorbs the latest European powder grinding technology and concept, and combines the suggestions of 9158 customers on grinding m

LM Vertical Mill

LM Vertical Mill

LM Vertical Grinding Mill integrates crushing, drying, grinding, separating and transport. The structure is simple while the layout is compact. Its occupational area is about 50% of that of the ball-milling system. The LM grinding mill can also be arr

TGM Trapezium Mill

TGM Trapezium Mill

TGM Super Pressure Trapezium Mill The operation principle of main unit of Trapezium mill is that main unit runs with the central shaft that is driven by a gear box. The top of the shaft is connected with a quincunx stand on which a grinding roller is

Predicted range aggregate processing in spatio-temporal

Predicted Range Aggregate Processing in Spatio-temporal Databases Wei Liao, Guifen Tang, Ning Jing, Zhinong Zhong School of Electronic Science and Engineering, National University of Defense Technology Changsha, China [email protected] Abstract Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal

More

CiteSeerX — Predicted Range Aggregate Processing in Spatio

CiteSeerX Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal databases. Recent studies have developed two major classes of PRA query methods: (1) accurate approaches, which search the common moving objects indexes to obtain an accurate result; and (2) estimate methods, which utilize

More

Predicted Range Aggregate Processing in Spatio-temporal

Request PDF Predicted Range Aggregate Processing in Spatio-temporal Databases Predicted range aggregate (PRA) query is an important researching issue in spatio

More

Predicted range aggregate processing in spatio-temporal

Title: Microsoft Word Predicted range aggregate processing in spatio-temporal database0622.doc Author: wliao Created Date: 7/7/2006 8:15:58 PM

More

Predicted Range Aggregate Processing in Spatio-temporal

Predicted Range Aggregate Processing in Spatio-temporal Databases . By Wei Liao, Guifen Tang, Ning Jing and Zhinong Zhong. Abstract. Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal databases. Recent studies have developed two major classes of PRA query methods: (1) accurate approaches, which search the

More

Range Aggregate Processing In Spatial Databases

range aggregate processing in spatial databases. Range Aggregate Processing in Spatial Databases by Yufei Tao, Dimitris Papadias TKDE, 2004 Abstract—A range aggregate query returns summarized information about the points falling in a hyperrectangle (e.g., the total number of these points instead of their concrete ids).

More

Indexing range sum queries in spatio-temporal databases

Apr 01, 2007· The R-tree is known to be one of the most popular index structures to efficiently process window queries in spatial databases. Intuitively, the aggregate R-tree (aR-tree),improves the R-tree’s performance in range sum queries by storing, in each intermediate entry, pre-aggregated sums of the objects in the subtree. Fig. 1 shows an example of an aR-tree.

More

INDEXING AND QUERY PROCESSING TECHNIQUES IN SPATIO

uncertainty management, spatio-temporal indexing and querying issues, and data mining including traffic and location prediction. Nowadays query processing and indexing methods have an essential one for data retrieval in spatial temporal network. Query processing

More

aggregate query processing definition

Predicted Range Aggregate Processing in Spatio-temporal Databases1.25 Мб. In this paper, we focus on accurate PRA queries processing with a novel aggregate index.The rest of the paper is organized as follows: Section 2 reviews previous work related to ours. Section 3 provides the problem definition and an overview of the proposed methods.

More

Spatio-Temporal Aggregation Using Sketches

Papadias et al. [PTKZ02] propose the aRB- (aggregate R- B-) tree for the efficient processing of spatio-temporal count queries. In the aRB-tree, the extents of all regions (in this case r1, r2, r3, r4) are stored in an R-tree. Each entry of the R-tree is associated with a pointer to a B-tree that stores historical aggregate data about the entry.

More

Indexing range sum queries in spatio-temporal databases

Apr 01, 2007· The R-tree is known to be one of the most popular index structures to efficiently process window queries in spatial databases. Intuitively, the aggregate R-tree (aR-tree),improves the R-tree’s performance in range sum queries by storing, in each intermediate entry, pre-aggregated sums of the objects in the subtree. Fig. 1 shows an example of an aR-tree.

More

Spatial Predictive Query Processing on Road Networks

May 23, 2016· Used to answer predictive point query as a building block on which other types of predictive queries (e.g., KNN, range, and aggregate queries) are supported as well. Example for predictive point query, within the next 30 min, object o 1 is expected to be at node n 3 with probability 0.8, R(Q(n 3,30)) = { < o 1,0.8 > }.

More

Spatio-Temporal Aggregation Using Sketches

Then, ,assuming basic knowledge of R-trees [G84, SRF87, ,BKSS90], we describe the existing approaches for ,aggregate processing in multi-dimensional spaces, ,focusing on spatio-temporal applications. ,2.1 The FM algorithm and counting sketch ,Estimating the number of distinct objects in a dataset has ,received considerable attention (see [PGF02

More

Historical spatio-temporal aggregation ACM Transactions

The methods support dynamic spatio-temporal dimensions for the efficient processing of historical aggregate queries without a priori knowledge of grouping hierarchies. The superiority of the proposed techniques over existing methods is demonstrated through a comprehensive probabilistic analysis and an extensive experimental evaluation.

More

(PDF) Panda: A predictive spatio-temporal query processor

processing and the maintenance of precomputed answers, respec- tively,were described in terms of a generic function, termed Up- dateResults(Result,List),called twice in each algorithm.

More

Indexing and Retrieval of Historical Aggregate Information

The aggregate R-tree [8] improves the original R-tree [4, 3] towards aggregate processing by storing, in each intermediate entry, summarized data about objects residing in the subtree. In case of the countfunction, for example, each entry stores the number of objects in its subtree (the extension to any non-holistic functions is straightforward ).

More

BORA: Routing and Aggregation for Distributed Processing

server involved in processing of the Q1, then it will end up having to execute an aggregation of the time-intervals among 125,000 OIDs, and OIDs are sorted, then it will need to execute a 25-way merge of (sorted) sets of size 5,000 each. However, if C2,4 and C2,6 begin to aggregate the data that they have received, while waiting for C2,5 to

More

On spatio-temporal blockchain query processing ScienceDirect

Sep 01, 2019· We evaluate the performance of spatio-temporal queries (Section 5): (i) for temporal range up to 2 weeks, (ii) for increasing number of hours over a block-DAG with B s i z e = 40, and (iii) B s i z e = 100, (iv) performance change for a fixed temporal range, 2 h, for increasing number of transactions included in the block-DAG.

More

Predictive Spatio-Temporal Queries: A Comprehensive

of objects N predicted to be inside Rafter time t. A comprehensive technique [55] that employs adaptive multi-dimensional histogram (AMH), historical synopsis, and stochastic method is used to pro-vide an approximate answer for aggregate spatio-temporal queries for

More

Indexing Spatio-Temporal Data Warehouses

spatio-temporal data warehouses. Depending on the type of queries posed, a spatio-temporal OLAP system should capture different types of summarized data. Since our focus is on indexing, we assume some simple aggregate functions like count, or average. In more complex situations we could also store additional measures including the source and the

More

Scalable Spatial Predictive Query Processing for Moving

3.3 Panda: A Predictive Spatio-Temporal Query Processing . . . . . . 17 the predicted location of a user after some time in the future. Common types of predictive spatial queries include predictive range query, e.g., “find all hotels that predictive aggregate query, and predictive point query. This is done

More

Euler histogram tree Proceedings of the 7th ACM

Spatio-temporal aggregation using sketches. In ICDE, 2004. Google Scholar Digital Library; Y. Tao and D. Papadias. Range aggregate processing in spatial databases. IEEE TKDE, 16(12), 2004. Google Scholar Digital Library; H. Xie, E. Tanin, and L. Kulik. Distributed histograms for processing aggregate data from moving objects. In IEEE MDM, 2007.

More