27 ;;Quote: relaxed, extensible text formats and protocols work better than efficient binary ones; easily shared and understood
|
28 ;;Quote: linear scaling and simplicity important for Web applications; allows high volumes and throughput
|
28 ;;Quote: stale data is OK; most data is updated infrequently or not at all; allows lazy replication and scalability
|
28 ;;Quote: successful systems on the Web are bottom-up, depending on the wisdom of crowds
|
28 ;;Quote: people understand graphs of tree-like documents (HTML) connected by links (URL)
|
28 ;;Quote: web servers normally handle 100 requests a second within an order of magnitude
|
28+;;Quote: avoid servers responding to fine-grained events; e.g., keystrokes or mouse moves
|
28 ;;Quote: servers should run asynchronously with respect to clients; loosely coupled, maximize throughput, prioritize requests, failover
|
29 ;;Quote: XML should indicate nearly, static elements; simplifies update of stale data
|
29 ;;Quote: XML should be understandable and useable without a universal schema
|
29+;;Quote: an XML schema is a shared secret that ties clients and servers together
|
30 ;;Quote: XML doesn't handle links; the division of the data world into chunks depends on the person and purpose
|
30+;;Quote: use self-describing links with purpose and MIME type; e.g., purpose="comments" type="text/atom"
|
30 ;;Quote: XML does not distinguish between data and sets of data
|
30 ;;Quote: Atom XML is a container (feed) of unorder entry elements; must include id, updated, and title; any other elements OK
|
30 ;;Quote: can reliably replace Atom entries with the same and
|
31 ;;Quote: display menus of Atom entries using , <content>, and <summary> elements<br>
<tr><td>31 ;;<a name="th-0560-7178"></a><a href="thid-0400-6455-th-0560-7178">Quote</a>: reference binary data as a <link> with MIME type and size; allows consumers to make intelligent choices about fetching
</table></blockquote></th_quotes>
<hr>
<p><a name=topics></a><b>Related Topics</b> <a href="#top"><img alt=up border=0 height=11 width=11 src="../images/up.gif"></a>
<blockquote><a href="thid-0513-0671-th-1141-9636#th-0946-2464">Topic</a>: communication protocols (62 items)
<br><a href="thid-0513-0671-th-0774-6977#th-0946-2464">Topic</a>: World-Wide Web (42 items)
<br><a href="thid-0513-0671-th-1451-1929#th-0946-2464">Topic</a>: no need for efficiency (28 items)
<br><a href="thid-1459-5035-th-1642-9134#th-0946-2464">Group</a>: parallel processing (41 topics, 1125 quotes)
<br><a href="thid-0513-0671-th-1478-3900#th-0946-2464">Topic</a>: replicated data (51 items)
<br><a href="thid-0513-0671-th-0406-0317#th-0946-2464">Topic</a>: updating information in a distributed system (50 items)
<br><a href="thid-0513-0671-th-0326-4525#th-0946-2464">Topic</a>: top-down vs. bottom-up design (30 items)
<br><a href="thid-0513-0671-th-1100-2475#th-0946-2464">Topic</a>: text markup and structured text (25 items)
<br><a href="thid-0513-0671-th-0732-2551#th-0946-2464">Topic</a>: XML data type (22 items)
<br><a href="thid-0513-0671-th-1049-6888#th-0946-2464">Topic</a>: client-server model for distributed systems (25 items)
<br><a href="thid-0513-0671-th-0975-3932#th-0946-2464">Topic</a>: XML schemas (16 items)
<br><a href="thid-0513-0671-th-0623-5921#th-0946-2464">Topic</a>: understanding systems (48 items)
<br><a href="thid-0513-0671-th-1345-6681#th-0946-2464">Topic</a>: hypertext nodes (19 items)
<br><a href="thid-0513-0671-th-0403-3315#th-0946-2464">Topic</a>: hypertext links (45 items)
<br><a href="thid-0513-0671-th-0847-2486#th-0946-2464">Topic</a>: set data type (16 items)
<br><a href="thid-1459-5035-th-0953-0731#th-0946-2464">Group</a>: sets (7 topics, 148 quotes)
<br><a href="thid-0513-0671-th-0535-4170#th-0946-2464">Topic</a>: electronic news and blogs (25 items)
<br><a href="thid-0513-0671-th-0642-5679#th-0946-2464">Topic</a>: descriptive naming (29 items)
<br><a href="thid-0513-0671-th-1206-6523#th-0946-2464">Topic</a>: browsing with a user interface (14 items)
</blockquote>
</td></tr></table>
<hr><font size=-1>
Collected barberCB 10/06 <br>
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.<br>Thesa is a trademark of C. Bradford Barber.
</font>
</body></html>
|