Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent chuan-xiao.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wei-wang.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent xuemin-lin.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent jeffrey-xu-yu.
- item-4 previous item-3.
- 114 creator byron-choi.
- 114 creator ramadhana-bramandia.
- 114 creator wee-kong-ng.
- 114 type InProceedings.
- 114 label "On Incremental Maintenance of 2-hop Labeling of Graphs".
- 114 sameAs 114.
- 114 abstract "Recent interests on \XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, some methods for {\it 2-hop} labels have been proposed to index large collections of \XML and/or graphs for efficient reachability tests. However, there has been few work on updates of {\it 2-hop} labeling. This is compounded by the fact that Web data changes over time. In response to these, this paper studies the incremental maintenance of {\it 2-hop} labeling. We identify the main reason for the inefficiency of updates of existing {\it 2-hop} labels. We propose two updatable {\it 2-hop} labelings, hybrids of {\it 2-hop} labeling, and their incremental maintenance algorithms. The proposed {\it 2-hop} labeling is derived from graph connectivities, as opposed to {\sc set cover} which is used by {\em all} previous work. Our experimental evaluation illustrates the space efficiency and update performance of various kinds of {\it 2-hop} labeling. The main conclusion is that there is a natural way to spare some index size for update performance in {\it 2-hop} labeling.".
- 114 hasAuthorList authorList.
- 114 hasTopic World_Wide_Web.
- 114 isPartOf proceedings.
- 114 keyword "Semantic Web".
- 114 keyword "XML".
- 114 title "On Incremental Maintenance of 2-hop Labeling of Graphs".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent ramadhana-bramandia.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent byron-choi.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent wee-kong-ng.
- item-3 previous item-2.
- 138 creator amin-saberi.
- 138 creator hamid-nazerzadeh.
- 138 creator rakesh-vohra.
- 138 type InProceedings.
- 138 label "Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising".
- 138 sameAs 138.
- 138 abstract "We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption, may be unknown to that agent. The problem is motivated by keyword auctions, where the resource to be allocated is a slot on a search page. We describe a mechanism based on a sampling-based learning algorithm that under suitable assumptions is asymptotically individually rational, asymptotically Bayesian incentive compatible and asymptotically ex-ante efficient. The mechanism can be interpreted as a cost per action keyword auction.".
- 138 hasAuthorList authorList.
- 138 hasTopic World_Wide_Web.
- 138 isPartOf proceedings.
- 138 keyword "Cost-Per-Action".
- 138 keyword "Mechanism Design".
- 138 keyword "Sponsored Search".
- 138 title "Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent hamid-nazerzadeh.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent amin-saberi.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent rakesh-vohra.
- item-3 previous item-2.
- 151 creator chi-hung-chi.
- 151 creator guillaume-pierre.
- 151 creator jiang-dejun.
- 151 creator maarten-van-steen.
- 151 creator zhou-wei.
- 151 type InProceedings.
- 151 label "Service-Oriented Data Denormalization for Scalable Web Applications".
- 151 sameAs 151.
- 151 abstract "Many techniques have been proposed to scale web applications. However, the data interdependencies between the database queries and transactions issued by the applications limit their efficiency. We claim that major scalability improvements can be gained by restructuring the web application data into multiple independent data services with exclusive access to their private data store. While this restructuring does not provide performance gains by itself, the implied simplification of each database workload allows a much more efficient use of classical techniques. We illustrate the data denormalization process on three benchmark applications: TPC-W, RUBiS and RUBBoS. We deploy the resulting service-oriented implementation of TPC-W across an 85-node cluster and show that restructuring its data can provide at least an order of magnitude improvement in the maximum sustainable throughput compared to master-slave database replication, while preserving strong consistency and transactional properties.".
- 151 hasAuthorList authorList.
- 151 hasTopic World_Wide_Web.
- 151 isPartOf proceedings.
- 151 keyword "Data denormalization".
- 151 keyword "Scalability".
- 151 keyword "Web applications".
- 151 title "Service-Oriented Data Denormalization for Scalable Web Applications".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent zhou-wei.