the nodes, but also provide space – and time–efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2–hop cover by developing scalable methods for index creation on very large XML

Abstract. As many metadata are encoded in XML, and many digital libraries need to manage XML documents, efficient techniques for search-ing in such formatted data are required. In order to efficiently process path expressions with wildcards on XML data, a new path index is pro-posed. Extensive

User queries on XML documents are typically expressed as regular path expres-sions. A variety of novel indexing techniques for efficiently retrieving the results to such queries have been proposed in the recent literature. While these techniques are generic to documents that are completely schema

Traditionally, XML documents are processed at where they are stored. This allows the query processor to exploit pre-computed data structures (e.g., index) to retrieve the desired data efficiently. However, this mode of processing is not suitable for many applications where the documents

, 2000), Brander, Amit, and Antweiler (2002) and D. VC Firm Experience Kaplan and Schoar E. Network Measures Over our sample period, the VC industry saw substantial entry and exit and thus a considerable reordering of relationships. To capture the dynamics of these processes, we construct a new

. In the first step, we identify a set of query patterns from a new schema summary; in the second step, all query patterns are processed based on two efficient indices, partial path index and entity path index. The experimental results show that our method is both effective and efficient.

have developed a new system called psiX that runs on top of an existing distributed hashing framework. Under the psiX system, each XML document is mapped into an algebraic signature that captures the structural summary of the document. An XML query pattern is also mapped into a signature. The query’s

profiles, in the form of keyword queries, which capture the data requirement of users/applications, as opposed to path expressions, such as XPath/XQuery expressions. KEMB brings new challenges: 1) how to effectively identify relevant answers of keyword queries in XML data streams; and 2) how to efficiently

which relates to objects shown on a map. A biologist using BioXMash searches in XML tags, and is guided by XML path data availability, shown as the number of values reachable via a path, in both global, genome-wide, and local, pergene, context. Then she examines sample values in an area of interest

As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing