1. Stored Procedures for Web Search Engine Dejan Sunderic www.TrigonBlue.com

2. Solutions to Performance Problems Splitting resultset Denormalization

3. Previous Situation Three types of queries (quick, advanced, full)quickadvanced full Small number of concurrent users Typical query run at least 5 to 10 sec Workarounds

4. Example Query example Queryexample ERD example ERDexample Resultset

5. Technical issues Join on many tables Table scans (indexes, Like) Complete resultset sent to the client (B)locking Guid as nvarchar Sorting

6. How Did We Get Here? normalization OLTP v. DSS OO design Code generators

7. Available options (pro/contra) Denormalization Limiting resultset Splitting resultset Indexing Stored procedures v. ad-hock queries Search typestypes

8. Splitting Result Web server Temporary table Static table(s)

9. Denormalization Table structure (denormalized v. normalized)denormalizednormalized Surrogate index fields Process execution Process

10. Quick Queries Stored procedure Sorting Result splitting Top vs. Rowcount Next batch Search types Count

11. Advanced Query Dynamically assembled queries Dynamically queries Criteria Batch size Table joins Arrays in TSQL

12. Performance improvements Page rendering under 1 sec. IOs reduced more then 3 times (B)locking avoided 100s of concurrent users Network traffic reduced

13. What next ? Advanced queries with fixed params Reduce change delay ? Resultset length hard-coded Link with Capability Profiles Full-text search

14. Call to Action Always do splitting of a result Evaluate denormalization for searching/reporting Contact dejans@hotmail.com www.TrigonBlue.com