Matches in ScholarlyData for { ?s ?p ?o. }
- 790 abstract "Traditionally, information extraction from web tables has focused on small more or less homogeneous corpora, often based on assumptions about the semantics and use of <table> tags. A multitude of implementation forms of tables render these approaches difficult to scale. In this paper, we address the problem of domain-independent information extraction from web tables by shifting the focus from the tree-based representation of web pages to the 2-dimensional representation as intended by human authors for human readers. This additional visual information would allow us to fill the gap between syntax and domain dependent semantic. We show that this approach gives us a new set of features, which allow each of the steps of table location, recognition and interpretation to work without any reliance on domain-specific knowledge or domain-specific table templates.".
- 790 hasAuthorList authorList.
- 790 isPartOf proceedings.
- 790 title "Domain Independent Information Extraction from Web Tables".
- 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 wolfgang-gatterbauer.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent paul-bohunsky.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent marcus-herzog.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent bernhard-kruepl.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent bernhard-pollak.
- item-5 previous item-4.
- 793 creator alexander-loeser.
- 793 creator huaiyu-zhu.
- 793 creator shivakumar-vaithyanathan.
- 793 creator sriram-raghavan.
- 793 type InProceedings.
- 793 label "Navigating the intranet with high precision".
- 793 sameAs 793.
- 793 abstract "Despite the success of web search engines, search over large enterprise intranets still suffers from poor result quality. Earlier work that compared intranets and the Internet from the view point of keyword search has pointed to several reasons why the search problem is quite different in these two domains. In this paper, we address the problem of providing high quality answers to navigational queries in the intranet (e.g., queries intended to find product or personal home pages, service pages, etc.). Our approach is based on offline identification of navigational pages, intelligent generation of term-variants to associate with each page, and the construction of separate indices exclusively devoted to answering navigational queries. Using a testbed of 5.5M pages from the IBM intranet, we present evaluation results that demonstrate that for navigational queries, our approach of using custom indices produces results of significantly higher precision than those produced by a general purpose search algorithm.".
- 793 hasAuthorList authorList.
- 793 isPartOf proceedings.
- 793 title "Navigating the intranet with high precision".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent alexander-loeser.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sriram-raghavan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent shivakumar-vaithyanathan.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent huaiyu-zhu.
- item-4 previous item-3.
- 794 creator raymond-wong.
- 794 type InProceedings.
- 794 label "Querying and Maintaining a Compact XML Storage".
- 794 sameAs 794.
- 794 abstract "As XML database sizes grow, the amount of space used for storing the data and auxiliary supporting data structures becomes a major factor in query and update performance. This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time. In addition to supporting efficient queries, the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum, while insertions and deletions can be performed in near constant time as well. As a result, the proposed structure features a small memory footprint that increases cache locality, whilst still supporting standard APIs, such as DOM, and necessary database operations, such as queries and updates, efficiently. Analysis and experiments show that the proposed structure is space and time efficient.".
- 794 hasAuthorList authorList.
- 794 isPartOf proceedings.
- 794 title "Querying and Maintaining a Compact XML Storage".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent raymond-wong.
- 800 creator jiangong-zhang.
- 800 creator torsten-suel.
- 800 type InProceedings.
- 800 label "Efficient Search in Large Textual Collection with Redundancy".
- 800 sameAs 800.
- 800 abstract "Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many different crawls and versions of each page. One important example of such a collection is the Internet Archive, though there are many others. Since the data size of such an archive is multiple times that of a single snapshot, this presents us with significant performance challenges. Current engines use various techniques for index compression and optimized query execution, but these techniques do not exploit the significant similarities between different versions of a page, or between different pages.<br /><br /> In this paper, we propose a general framework for indexing and query processing of archival collections and, more generally, any collections with a significant amount of redundancy. Our approach results in very significant reductions in index size and query processing costs on such collections, and it is orthogonal to and can be combined with the existing techniques. It also supports highly efficient updates, both locally and over a network. Within this framework, we describe and evaluate several different implementations that trade off index size versus CPU cost and other factors, and discuss applications ranging from archival web search to local search of web sites, email archives, or file systems. We present experimental results based on search engine query log and a large collection consisting of multiple crawls.".
- 800 hasAuthorList authorList.
- 800 isPartOf proceedings.
- 800 title "Efficient Search in Large Textual Collection with Redundancy".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent jiangong-zhang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent torsten-suel.
- item-2 previous item-1.
- 801 creator collin-jackson.
- 801 creator helen-wang.
- 801 type InProceedings.
- 801 label "Subspace: Secure Cross-Domain Communication for Web Mashups".