[GitHub] [carbondata-site] ajantha-bhat opened a new pull request #79: [WIP] update carbondata 2.1.1 release

[GitBox]

ajantha-bhat opened a new pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79


   1. Added a dropdown for carbondata 2.1.1 release
   2. TODO: update spatial index and clean files document


--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

ajantha-bhat commented on pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#issuecomment-816671605


   @sraghunandan , @chenliang613 : Please review and merge this.


--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

PurujitChaugule commented on a change in pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#discussion_r611622451



##########
File path: src/site/markdown/spatial-index-guide.md
##########
@@ -32,12 +32,28 @@ Below figure shows the relationship between the grid and the points residing in
 
 
 Carbon supports Polygon User Defined Function(UDF) as filter condition in the query to return all the data points lying within it. Polygon UDF takes multiple points(i.e., pair of longitude and latitude) separated by a comma. Longitude and latitude in the pair are separated by a space. The first and last points in the polygon must be same to form a closed loop. CarbonData builds a quad tree using this polygon and spatial region information passed while creating a table. The nodes in the quad tree are composed of indices generated by the row and column information projected in the polygon area. When the grid center point lies within the polygon area, the grid is considered as selected. In the following figure, user selects a quadrilateral shaped polygon. The grid at the center of the region is chosen to build a quad tree. Once tree is build, all the leafs are scanned to get the list of range of indices(with each range consisting of minimum index and maximum index in the range). All th
 e indices starting from minimum to maximum in each range forms the result.
-The main reasons for faster query response are as follows :
-* Data is sorted based on the index values.
-* Polygon UDF filter is pushed down from engine to the carbon layer such that CarbonData scans only matched blocklets avoiding full scan.
 
 
 
+There are some other UDFs supporting more filter conditions in the query, including Polygon List, Polyline List, and spatial index range list.
+
+Polygon List UDF takes multiple polygons(i.e., a set of points) and operation type for combining polygons. Only `OR` and `AND` are supported at present, operation 'OR' means union of multiple polygons and 'AND' means intersection of that, shown as the following figure. Then CarbonData gets the list of range of indices from the combined region by quad tree, which is the same processing as Polygon UDF.
+
+
+
+Polyline List UDF takes multiple polylines(i.e., a set of points) and buffer in meter. CarbonData first converts polyline to polygon and then gets the list of range of indices from these polygons. The processing is the same as Polygon UDF and return all the data points lying within the buffer region of polylines.
+

Review comment:
       can mention the unit of measurement i.e. meters, used for buffer size in PolyLine UDF




--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

ajantha-bhat commented on a change in pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#discussion_r611626814



##########
File path: src/site/markdown/spatial-index-guide.md
##########
@@ -32,12 +32,28 @@ Below figure shows the relationship between the grid and the points residing in
 
 
 Carbon supports Polygon User Defined Function(UDF) as filter condition in the query to return all the data points lying within it. Polygon UDF takes multiple points(i.e., pair of longitude and latitude) separated by a comma. Longitude and latitude in the pair are separated by a space. The first and last points in the polygon must be same to form a closed loop. CarbonData builds a quad tree using this polygon and spatial region information passed while creating a table. The nodes in the quad tree are composed of indices generated by the row and column information projected in the polygon area. When the grid center point lies within the polygon area, the grid is considered as selected. In the following figure, user selects a quadrilateral shaped polygon. The grid at the center of the region is chosen to build a quad tree. Once tree is build, all the leafs are scanned to get the list of range of indices(with each range consisting of minimum index and maximum index in the range). All th
 e indices starting from minimum to maximum in each range forms the result.
-The main reasons for faster query response are as follows :
-* Data is sorted based on the index values.
-* Polygon UDF filter is pushed down from engine to the carbon layer such that CarbonData scans only matched blocklets avoiding full scan.
 
 
 
+There are some other UDFs supporting more filter conditions in the query, including Polygon List, Polyline List, and spatial index range list.
+
+Polygon List UDF takes multiple polygons(i.e., a set of points) and operation type for combining polygons. Only `OR` and `AND` are supported at present, operation 'OR' means union of multiple polygons and 'AND' means intersection of that, shown as the following figure. Then CarbonData gets the list of range of indices from the combined region by quad tree, which is the same processing as Polygon UDF.
+
+
+
+Polyline List UDF takes multiple polylines(i.e., a set of points) and buffer in meter. CarbonData first converts polyline to polygon and then gets the list of range of indices from these polygons. The processing is the same as Polygon UDF and return all the data points lying within the buffer region of polylines.
+

Review comment:
       whatever there in github document, same thing I ma updating in the website.
   https://github.com/apache/carbondata/tree/master/docs
   
   This kind of changes you cannot request here, please comment on original PR or raise new PR in github.




--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

ajantha-bhat commented on a change in pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#discussion_r611626814



##########
File path: src/site/markdown/spatial-index-guide.md
##########
@@ -32,12 +32,28 @@ Below figure shows the relationship between the grid and the points residing in
 
 
 Carbon supports Polygon User Defined Function(UDF) as filter condition in the query to return all the data points lying within it. Polygon UDF takes multiple points(i.e., pair of longitude and latitude) separated by a comma. Longitude and latitude in the pair are separated by a space. The first and last points in the polygon must be same to form a closed loop. CarbonData builds a quad tree using this polygon and spatial region information passed while creating a table. The nodes in the quad tree are composed of indices generated by the row and column information projected in the polygon area. When the grid center point lies within the polygon area, the grid is considered as selected. In the following figure, user selects a quadrilateral shaped polygon. The grid at the center of the region is chosen to build a quad tree. Once tree is build, all the leafs are scanned to get the list of range of indices(with each range consisting of minimum index and maximum index in the range). All th
 e indices starting from minimum to maximum in each range forms the result.
-The main reasons for faster query response are as follows :
-* Data is sorted based on the index values.
-* Polygon UDF filter is pushed down from engine to the carbon layer such that CarbonData scans only matched blocklets avoiding full scan.
 
 
 
+There are some other UDFs supporting more filter conditions in the query, including Polygon List, Polyline List, and spatial index range list.
+
+Polygon List UDF takes multiple polygons(i.e., a set of points) and operation type for combining polygons. Only `OR` and `AND` are supported at present, operation 'OR' means union of multiple polygons and 'AND' means intersection of that, shown as the following figure. Then CarbonData gets the list of range of indices from the combined region by quad tree, which is the same processing as Polygon UDF.
+
+
+
+Polyline List UDF takes multiple polylines(i.e., a set of points) and buffer in meter. CarbonData first converts polyline to polygon and then gets the list of range of indices from these polygons. The processing is the same as Polygon UDF and return all the data points lying within the buffer region of polylines.
+

Review comment:
       whatever there in github document, same thing I am updating in the website.
   https://github.com/apache/carbondata/tree/master/docs
   
   This kind of changes you cannot request here, please comment on original PR or raise new PR in github.




--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

PurujitChaugule commented on a change in pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#discussion_r611622451



##########
File path: src/site/markdown/spatial-index-guide.md
##########
@@ -32,12 +32,28 @@ Below figure shows the relationship between the grid and the points residing in
 
 
 Carbon supports Polygon User Defined Function(UDF) as filter condition in the query to return all the data points lying within it. Polygon UDF takes multiple points(i.e., pair of longitude and latitude) separated by a comma. Longitude and latitude in the pair are separated by a space. The first and last points in the polygon must be same to form a closed loop. CarbonData builds a quad tree using this polygon and spatial region information passed while creating a table. The nodes in the quad tree are composed of indices generated by the row and column information projected in the polygon area. When the grid center point lies within the polygon area, the grid is considered as selected. In the following figure, user selects a quadrilateral shaped polygon. The grid at the center of the region is chosen to build a quad tree. Once tree is build, all the leafs are scanned to get the list of range of indices(with each range consisting of minimum index and maximum index in the range). All th
 e indices starting from minimum to maximum in each range forms the result.
-The main reasons for faster query response are as follows :
-* Data is sorted based on the index values.
-* Polygon UDF filter is pushed down from engine to the carbon layer such that CarbonData scans only matched blocklets avoiding full scan.
 
 
 
+There are some other UDFs supporting more filter conditions in the query, including Polygon List, Polyline List, and spatial index range list.
+
+Polygon List UDF takes multiple polygons(i.e., a set of points) and operation type for combining polygons. Only `OR` and `AND` are supported at present, operation 'OR' means union of multiple polygons and 'AND' means intersection of that, shown as the following figure. Then CarbonData gets the list of range of indices from the combined region by quad tree, which is the same processing as Polygon UDF.
+
+
+
+Polyline List UDF takes multiple polylines(i.e., a set of points) and buffer in meter. CarbonData first converts polyline to polygon and then gets the list of range of indices from these polygons. The processing is the same as Polygon UDF and return all the data points lying within the buffer region of polylines.
+

Review comment:
       can mention the unit of measurement i.e. meters, used for buffer size in PolyLine UDF




--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

ajantha-bhat commented on a change in pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79#discussion_r611626814



##########
File path: src/site/markdown/spatial-index-guide.md
##########
@@ -32,12 +32,28 @@ Below figure shows the relationship between the grid and the points residing in
 
 
 Carbon supports Polygon User Defined Function(UDF) as filter condition in the query to return all the data points lying within it. Polygon UDF takes multiple points(i.e., pair of longitude and latitude) separated by a comma. Longitude and latitude in the pair are separated by a space. The first and last points in the polygon must be same to form a closed loop. CarbonData builds a quad tree using this polygon and spatial region information passed while creating a table. The nodes in the quad tree are composed of indices generated by the row and column information projected in the polygon area. When the grid center point lies within the polygon area, the grid is considered as selected. In the following figure, user selects a quadrilateral shaped polygon. The grid at the center of the region is chosen to build a quad tree. Once tree is build, all the leafs are scanned to get the list of range of indices(with each range consisting of minimum index and maximum index in the range). All th
 e indices starting from minimum to maximum in each range forms the result.
-The main reasons for faster query response are as follows :
-* Data is sorted based on the index values.
-* Polygon UDF filter is pushed down from engine to the carbon layer such that CarbonData scans only matched blocklets avoiding full scan.
 
 
 
+There are some other UDFs supporting more filter conditions in the query, including Polygon List, Polyline List, and spatial index range list.
+
+Polygon List UDF takes multiple polygons(i.e., a set of points) and operation type for combining polygons. Only `OR` and `AND` are supported at present, operation 'OR' means union of multiple polygons and 'AND' means intersection of that, shown as the following figure. Then CarbonData gets the list of range of indices from the combined region by quad tree, which is the same processing as Polygon UDF.
+
+
+
+Polyline List UDF takes multiple polylines(i.e., a set of points) and buffer in meter. CarbonData first converts polyline to polygon and then gets the list of range of indices from these polygons. The processing is the same as Polygon UDF and return all the data points lying within the buffer region of polylines.
+

Review comment:
       whatever there in github document, same thing I am updating in the website.
   https://github.com/apache/carbondata/tree/master/docs
   
   This kind of changes you cannot request here, please comment on original PR or raise new PR in github.




--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[GitBox]

ajantha-bhat closed pull request #79:
URL: https://github.com/apache/carbondata-site/pull/79


   


--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

For queries about this service, please contact Infrastructure at:
[hidden email]

[floras12]

Keeping documentation current makes collaboration much smoother, and the same idea applies to immigration tracking where even small date changes can affect the next step. Following monthly Visa Bulletin updates and checking whether your priority date is current helps applicants understand when they may be eligible to move forward with their case. read more to better understand how priority dates, Final Action Dates, and Dates for Filing work together.

[chrmhrtsstr]

Working with data processing and software updates often requires careful checking of results, and the same attention to accuracy applies to basic calculations. A useful learning resource is divisiones, which helps users understand division steps instead of only showing the final answer. Tools that explain the process can be helpful for students and anyone reviewing numerical operations during technical tasks.

[amelia]

Release work often benefits from having simple checks in place so small details do not get overlooked. For Abu Dhabi public transport users, keeping track of a Hafilat card balance is one such routine task, especially before boarding a bus. A quick check here can help users review their balance and avoid running short during a journey.

[aspire16]

Release discussions benefit from having clear reference details, and the same applies when checking traffic records and penalties through the relevant file number. The RTA fine check by traffic file number approach can help users review RTA fine details using their traffic file number, keeping routine checks more organized and straightforward.

[lia]

Technical project discussions often focus on keeping information organized and easy to access, and the same idea can apply when looking for entertainment content. Goojara presents movies and TV series with options for online streaming, search filters by genre and year, subtitles, and different video formats, so readers interested in exploring those features can see more while keeping the main discussion focused.