Samuel Akeroyde

Samuel Akeroyde (also Ackroyd, Ackroyde, Acroyd; fl. 1684-1706)[1] was a popular and prolific composer of songs in the latter part of the 17th century. He was born in Yorkshire. He wrote more than 100 songs.

Many of his compositions are contained in collections of the period, including: Thomas d'Urfey's Third Collection of Songs (1685); The Theatre of Musick (1685-1687); Vinculum Societatis (1687); Comes Amoris (1687-1694); The Banquet of Musick (1688-1692); Thesaurus Musicus (1693-1696); and in The Gentleman's Journal (1692-1694). He was also a contributor to the Third Part of D'Urfey's Don Quixote (1696).

Notes
  1. Spink, Ian (2001). "Akeroyde, Samuel". In Root, Deane L. (ed.). The New Grove Dictionary of Music and Musicians. Oxford University Press. ‎
gollark: Slower, even.
gollark: Oops, it turns out I'm accidentally sorting by it instead of the rank, but it's equally slow after fixing that.
gollark: ```nonlocality=# EXPLAIN ANALYZE SELECT url, ts_rank(fts, query), ts_headline(fts::text, query, 'MaxWords=60') AS rank FROM pages, websearch_to_tsquery('bee') query WHERE fts @@ query ORDER BY rank LIMIT 1; QUERY PLAN ------------------------------------------------------------------------------------------------------------------------------------------------- Limit (cost=860.92..860.92 rows=1 width=96) (actual time=8506.425..8506.427 rows=1 loops=1) -> Sort (cost=860.92..861.05 rows=52 width=96) (actual time=8506.423..8506.425 rows=1 loops=1) Sort Key: (ts_headline((pages.fts)::text, query.query, 'MaxWords=60'::text)) Sort Method: top-N heapsort Memory: 25kB -> Nested Loop (cost=688.65..860.66 rows=52 width=96) (actual time=1.362..8505.403 rows=348 loops=1) -> Function Scan on websearch_to_tsquery query (cost=0.25..0.26 rows=1 width=32) (actual time=0.023..0.025 rows=1 loops=1) -> Bitmap Heap Scan on pages (cost=688.40..846.49 rows=52 width=142) (actual time=0.353..1.502 rows=348 loops=1) Recheck Cond: (fts @@ query.query) Heap Blocks: exact=231 -> Bitmap Index Scan on page_search_index (cost=0.00..688.39 rows=52 width=0) (actual time=0.320..0.320 rows=387 loops=1) Index Cond: (fts @@ query.query) Planning Time: 0.190 ms Execution Time: 8506.463 ms(13 rows)```
gollark: It's not a condition, it's an extra row on the output, and I can see exactly what it does via `EXPLAIN ANALYZE`.
gollark: Maybe I need a better full text search backend?!

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.