Parsing OSM XML iD OSMCha To-Fix Frontend Developer kepta - PowerPoint PPT Presentation

Mar 04, 2023 •139 likes •426 views

Parsing OSM XML iD OSMCha To-Fix Frontend Developer kepta kushan2020 Breaking down iD Breaking down iD 15% Rendering Painting 21% Javascript 64% HTML A sample of what iD is doing behind the scenes Breaking down JS 13% Draw Vector

Parsing OSM XML
iD OSMCha To-Fix Frontend Developer kepta kushan2020
Breaking down iD
Breaking down iD 15% Rendering Painting 21% Javascript 64% HTML A sample of what iD is doing behind the scenes
Breaking down JS 13% Draw Vector 42% GC 27% DOM Selector Parse XML Others 11%8%
Parsing XML eats up 25% of CPU Time
Solutions? • Stop parsing XML ?
Solutions? • Stop parsing XML ?
Solutions? • Stop parsing XML ? • Use clever techniques to defer the parsing of XML
Solutions? • Stop parsing XML ? • Use clever techniques to defer the parsing of XML
Solutions? • Stop parsing XML ? • Use clever techniques to defer the parsing of XML • Exploit the multi-core architecture of CPUs
Solutions? • Stop parsing XML ? • Use clever techniques to defer the parsing of XML • Exploit the multi-core architecture of CPUs
The Multi-threading Solution • Even the cheapest smartphone has at least two core for processing • Unlike UI, parsing can be easily o ffl oaded to a separate thread. • This will improve the response time and alleviate some of the pressure on main thread.
Browsers and Threads • Browser threads a.k.a web-workers do not   support DOM/XML
Browsers and Threads • Browser threads a.k.a web-workers do not   support DOM/XML • iD wasn’t written to be executed in a multi-threaded environment
Osm-Bizli • To circumvent the problem of not having DOM, I created a new library called Osm-Bizli . • It relies on string parsing of XML line by line. • It only understands the particular XML returned by the bbox API. • With these focused features, it is able to deliver impressive performance.
How does it work? We parse the XML line by line.
How does it work? For each Entity we create a corresponding blank object.
How does it work? The attributes are populated.
How does it work?
How does it work? We then move to next line
How does it work? If the line starts with <nd or <tag we fill our way object with it
How does it work? Whenever we encounter a closing tag, we save the object and start fresh with new line.
Takeaways
Takeaways • Multi-threading would improve the performance of iD • Osm-bizli uses string parsing of OSM-xml to overcome the limitations of web-workers. • Opens future possibility of o ffl oading more tasks to web- worker.
Thanks

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

CSC 4181 Compiler Construction Parsing 1 1 Outline Top-down v.s. Bottom-up Top-down parsing

CSC 4181 Compiler Construction Parsing 1 1 Outline Top-down v.s. Bottom-up Top-down parsing Bottom-up parsing Recursive-descent Shift-reduce parsers parsing LR(0) parsing LL(1) parsing LR(0) items LL(1) parsing

429 views • 29 slides

Introduction to Bottom-Up Parsing Shift-reduce parsing The LR parsing algorithm

Outline Review LL parsing Introduction to Bottom-Up Parsing Shift-reduce parsing The LR parsing algorithm Constructing LR parsing tables 2 Top-Down Parsing: Review Top-Down Parsing: Review Top-down parsing expands a

470 views • 13 slides

Top-Down Parsing Slides modified from Louden Book and Dr. Scherger Top Down Parsing A

Compiler Design and Construction Top-Down Parsing Slides modified from Louden Book and Dr. Scherger Top Down Parsing A top-down parsing algorithm parses an input string of tokens by tracing out the steps in a leftmost derivation. Such an

1.12k views • 96 slides

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on

Statistical Dependency Parsing in Korean: From Corpus Generation To Automatic Parsing Workshop on Statistical Parsing of Morphologically-Rich Languages 12th International Conference on Parsing Technologies Jinho D. Choi & Martha Palmer

199 views • 19 slides

Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS

Basic Parsing Algorithms Chart Parsing Seminar Recent Advances in Parsing Technology WS 2011/2012 Anna Schmidt Talk Outline Chart Parsing Basics Chart Parsing Algorithms Earley Algorithm CKY Algorithm Basics

1.12k views • 73 slides

Overview Introduction Lexicalized TAG, Advantages of parsing with LTAG Parsing LTAGs

Parsing with Lexicalized TAG (1) Extracting and comparing LTAG (2) Presentation by Philip John Gorinski Seminar Recent Advances in Parsing Technology Saarland University, Winter Term 2011/12 (1) Yves Shabes, Aravind K. Joshi, 1990 (2)

514 views • 36 slides

* 07/16/96 Plan for Today Shift-reduce parsing The problem with predictive top down parsing

* 07/16/96 Plan for Today Shift-reduce parsing The problem with predictive top down parsing CS453 : Shift Reduce Parsing LR parsing: bottom up Unambiguous Grammars LR(0) and SLR Parse Tables Performs a right-most derivation in

316 views • 6 slides

1 Determinism and Parsing The parsing problem is, given a string w and a context-free grammar G ,

1 Determinism and Parsing The parsing problem is, given a string w and a context-free grammar G , to decide if w L ( G ), and if so, to construct a derivation or a parse tree for w . Parsing is studied in courses in compilers. To be efficient

519 views • 12 slides

Bottom-up parsing LR parsing Construct parse tree for input from leaves up LR( k ) parsing

Bottom-up parsing LR parsing Construct parse tree for input from leaves up LR( k ) parsing reducing a string of tokens to single start symbol L eft-to-right scan of input, R ightmost derivation (inverse of deriving a string of tokens from

413 views • 5 slides

Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont

9/26/2012 Bottom Up Parsing Also known as Shift-Reduce parsing More powerful than top down Dont need left factored grammars Can handle left recursion Bottom Up Parsing Attempt to construct parse tree from an input string

654 views • 6 slides

Dependency Parsing & Feature-based Parsing Ling571 Deep Processing Techniques for NLP

Dependency Parsing & Feature-based Parsing Ling571 Deep Processing Techniques for NLP February 2, 2015 Roadmap Dependency parsing Graph-based dependency parsing Maximum spanning tree CLE Algorithm Learning

899 views • 87 slides

Statistical Parsing Parsing context-free languages ar ltekin University of Tbingen

Statistical Parsing Parsing context-free languages ar ltekin University of Tbingen Seminar fr Sprachwissenschaft November 8, 2016 Recap Parsing basics CKY Earley Closing Ingredients of a (natural language) parser .

1.17k views • 51 slides

Generalised Parsing and Combinator Parsing A Happy Marriage? L. Thomas van Binsbergen

Conventional Parser Combinators Aspects of Generalised Parsing Combinators for Generalised Parsing Generalised Parsing and Combinator Parsing A Happy Marriage? L. Thomas van Binsbergen ltvanbinsbergen@acm.org Royal Holloway, University of

452 views • 30 slides

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs

Robust Incremental Neural Semantic Graph Parsing Jan Buys and Phil Blunsom Dependency Parsing vs Semantic Parsing Dependency parsing models the syntactic structure between words in a sentence. Dependency Parsing vs Semantic Parsing

637 views • 31 slides

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr

Statistical Parsing Dependency parsing ar ltekin University of Tbingen Seminar fr Sprachwissenschaft November 2016 Recap/background Dependency grammar Dependency parsing Evaluation Summary Ingredients of a parser

1.44k views • 89 slides

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing

Plan for Today Predictive parsing as a specific subclass of recursive descent parsing complexity comparisons with general parsing might have to left-factor necessary to remove left-recursion (MiniSVG modification as example) Working

346 views • 5 slides

CS533 One or more systems, real or hypothetical Modeling and Performance You want to

Overview CS533 One or more systems, real or hypothetical Modeling and Performance You want to evaluate their performance Evaluation of Network and What technique do you choose? Computer Systems Analytic Modeling?

79 views • 6 slides

Lifelong Optimisation (FA2386-12-1-4056) PI: Peter Stuckey, Pascal Van Hentenryck (NICTA,

Lifelong Optimisation (FA2386-12-1-4056) PI: Peter Stuckey, Pascal Van Hentenryck (NICTA, Melbourne), Toby Walsh (NICTA, Sydney) Senior Personnel: Dr Andreas Schutt (Melbourne), Dr Nina Narodytska (Melbourne) AFOSR Program Review: Mathematical

468 views • 25 slides

Who Cares About the Impact on Performance Memory Hierarchy? Suppose a processor executes at

8/20/08 Technology Trends Computer System Architecture Capacity Speed (latency) Logic: 2x in 3 years 2x in 3 years DRAM: 4x in 3 years 2x in 10 years Memory Part I Disk: 4x in 3 years 2x in 10 years DRAM Chalermek

290 views • 5 slides

CS 294-73 Software Engineering for Scientific Computing

CS 294-73 Software Engineering for Scientific Computing pcolella@berkeley.edu pcolella@lbl.gov Lecture 1: Introduction Grading 5-6 homework assignments, adding up to 60% of the grade. The final

516 views • 39 slides

Generalization of Cycle-Covering Heuristics Clemens B uchner Department of Mathematics and

Generalization of Cycle-Covering Heuristics Masters Thesis Presentation Generalization of Cycle-Covering Heuristics Clemens B uchner Department of Mathematics and Computer Science University of Basel May 14, 2020 Generalization of

877 views • 54 slides

APPG Energy Studies Briefing Neil Kenward 9 June 2020 The UK has made good progress to date,

Ofgems role in decarbonisation APPG Energy Studies Briefing Neil Kenward 9 June 2020 The UK has made good progress to date, especially in decarbonising power. Net zero represents a step change in ambition and challenge The UK has reduced

476 views • 8 slides

Checkable Proofs for First-Order Theorem Proving Giles Reger 1 , Martin Suda 2 1 School of Computer

Checkable Proofs for First-Order Theorem Proving Giles Reger 1 , Martin Suda 2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria ARCADE 2017 Gothenburg, August 6, 2017 1/8 Why do we want proofs? (explain

567 views • 29 slides

A Self-Verifying Theorem Prover Jared Davis (advertisement by J Strother Moore)

A Self-Verifying Theorem Prover Jared Davis (advertisement by J Strother Moore) Department of Computer Sciences University of Texas at Austin September 18, 2009 1 Theorem Prover ? Yes Proof Checker Yes No 2 Rules of

693 views • 40 slides