Abstract: A method for accessing webpages based on a transit mode is provided. A crawler route server receives a webpage access request sent from a client where the webpage access request contains identification of a target website to be accessed. The crawler route server obtains a target crawler server which has the fastest speed for accessing the target website corresponding to the identification of the target website to be accessed from at least one crawler server. Further, the method includes the crawler route server returns the identification of the target crawler server to the client, and the client accesses the target website through the target crawler server corresponding to the identification of the target crawler server.

Abstract: To process a sequence of outer joins in a database system, the database system performs a first outer join of the sequence of outer joins. A result of the first outer join is stored in a result table stored across plural storage modules of the database system. At least a subset of records of the result table is redistributed across the storage modules according to a first join attribute of the result table, where any record of the result table that has a null value for the first join attribute is not redistributed. A second outer join of the sequence is performed using the redistributed result table and another table, where the second outer join is based on the first join attribute of the result table.

Abstract: A small table S is outer joined to a large table L on a join condition on a database system with a plurality B of parallel units (PUs). S and L are partitioned across the PUs. Each row in S has a unique row-id. Each row of S is duplicated on all PUs to form Sdup. On each PU, dangling rows in S that do not have a match in L under the join condition are identified and the row-ids of the dangling rows are saved in Tredis. Tredis is partitioned across the PUs. P is formed from dangling rows of S whose corresponding entries in Tredis appear in all PUs. A result is produced by unioning P and I. I is formed by inner joining non-dangling rows of S with L. The result is saved.

Abstract: Various embodiments provide apparatus, systems, and methods for obtaining image and text information. In an exemplary method, an HTTP request can be sent to a web server based on URL information of the web server contained in a received HTTP request sent from a mobile terminal. HTML page information contained in a received HTTP response can be parsed to obtain image link information. An image HTTP request corresponding to the image link information can be sent to an image server. Image information returned from the image server can be received and packed with the HTML page information to form image and text information. The packed image and text information can then be sent to the mobile terminal that sends the HTTP request. In this manner, number of interactions between the mobile terminal and corresponding server(s) can thus be reduced.

Abstract: Techniques presented herein provide approaches for out-of-band host management via a management controller. In one embodiment, the management controller provides an application programming interface (API) specifying one or more functions for managing one or more applications executing on a host computer. The one or more functions may be invoked by a requesting entity.

Abstract: A method, apparatus and system for rendering a web page. A webcore is included at a server side and a RenderServer is configured at a server side in advance. The RenderServer parses a received web page into a DOM tree and sends the received web page to the webcore. The webcore renders the web page to form a render tree. The RenderServer transforms data information corresponding to Render objects on the render tree into binary stream according to the DOM tree and sends the binary stream to the mobile terminal. The mobile terminal performs drawing operation for the binary stream to implement web page browsing.

Abstract: The present invention, pertaining to the field of communications technologies, discloses a method, device, server, and mobile terminal for browsing web pages. The method includes: acquiring a web page requested by a user terminal; dividing the web page into at least two subpages when the number of bytes on the web page requested by the user terminal is larger than the number of bytes per subpage as predetermined by the user terminal; and sending a first subpage of the at least two subpages to the user terminal, and sending the link(s) of the subpage(s) other than the first subpage to the user terminal, so that the user terminal browses the web page according to the first subpage and the link(s). The device includes: a first acquiring module, a page dividing module, and a sending module. The mobile terminal includes: a sending module, a receiving module, and a browsing module. The present invention improves the browsing speed and operation speed, but also saves network traffic of the mobile terminal.

Abstract: A method, apparatus and system for rendering a web page. A webcore is included at a server side and a RenderServer is configured at a server side in advance. The RenderServer parses a received web page into a DOM tree and sends the received web page to the webcore. The webcore renders the web page to form a render tree. The RenderServer transforms data information corresponding to Render objects on the render tree into binary stream according to the DOM tree and sends the binary stream to the mobile terminal. The mobile terminal performs drawing operation for the binary stream to implement web page browsing.

Abstract: A method of searching a document having nested-structure document-specific markup (such as Extensible Markup Language (XML)) involves 112 receiving a query that designates at least (A) a phrase to be matched in a phrase matching process, and (B) a selective designation of at least a tag or annotation that is to be ignored during the phrase matching process. The method further involves 114 deriving query-specific indices based on query-independent indices that were created specific to each document, and 116 carrying out the phrase matching process using the query-specific indices on the document having the nested-structure document-specific markup.

Abstract: In general, a technique or mechanism is provided to efficiently transfer data of a distributed file system to a parallel database management system using an algorithm that avoids or reduces sending of blocks of files across computer nodes on which the parallel database management system is implemented.

Abstract: Embodiments of the present invention provide a method for processing a World Wide Web (WWW) page, which includes: determining at least one website to be optimized; generating a corresponding page template for each of WWW pages with different types in each website, and storing the page template; grabbing WWW pages from each website, matching each grabbed WWW page with a page template, filtering redundant HTML data from the WWW page according to a matching result, and storing the filtered WWW page; after receiving a request sent by a terminal for accessing a WWW page, determining whether there is a stored filtered WWW page corresponding to the WWW page requested by the terminal, if yes, returning the filtered WWW page to the terminal. Embodiments of the present invention also provide an apparatus for processing a WWW page. With the scheme of the present invention, redundant information may be efficiently eliminated.

Abstract: A system, method, and computer-readable medium for dynamic detection and management of data skew in parallel join operations are provided. Rows allocated to processing modules involved in a join operation are redistributed among the processing modules by a hash redistribution of the join attributes. Receipt by a processing module of an excessive number of redistributed rows having a skewed value on the join attribute is detected by a processing module which notifies other processing modules of the skewed value. Processing modules then terminate redistribution of rows having a join attribute value matching the skewed value and either store such rows locally or duplicate the rows. The processing module that has received an excessive number of redistributed rows removes rows having a skewed value of the join attribute from a redistribution spool allocated thereto and duplicates the rows to each of the processing modules.

Abstract: Techniques for fast loading data from an external distributed file system (DFS) to a database management system (DBMS) are provided. Assigning a portion of data from a file located in the DFS to each of a plurality of DFS clients. Configuring each DFS client to interact with a specific gateway from a plurality of gateways associated with the DBMS. Each gateway configured to send its portion of the file received from its designated client to every access module processor (AMP) controlled by that gateway. Each AMP processes a portion of the data received from the gateway to load the data into a table of the DBMS.

Abstract: Techniques for guided access to an external distributed file system (DFS) from a database management system (DBMS) are provided. A user access a graphical user interface (GUI) to interactively define a search on an external DFS. The search and any filtering conditions are processed on the external DFS and results are imported to the DBMS and mapped to a table in the DBMS for manipulation and access by the user within the DBMS.

Abstract: Techniques for accessing a parallel database system via an external program using vertical and/or horizontal partitioning are provided. An external program to a database management system (DBMS) configures external mappers to process a specific portion of query results on specific access module processors of the DBMS that are to house query results. The query is submitted by the external program to the DBMS and the DBMS is directed to organize the query results in a vertical or horizontal manner. Each external mapper accesses its portion of the query results for processing in parallel on its designated AMP or set of AMPS to process the query results.

Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.

Abstract: Techniques for optimizing outer joins in database operations are provided. In an embodiment, a query having an outer join with a GROUP BY clause is rewritten and expanded to expand a first level partition of that GROUP BY clause to produce a modified query. In another situation, rows associated with processing a query are each row split and then hashed based at least in part on attributes of the outer join predicate. A left outer join is performed and a global aggregation processed to produce a spooled table to process the query.

Abstract: Techniques for external application-directed data partitioning in data exported from a parallel database management system (DBMS) are provided. An external application sends a query, a total number of requested access module processors (AMPs), and an application-defined data partitioning expression to the DBMS. The DBMS executes the query with the results vertical partitioned on the identified number of AMPs. Individual external mappers access their assigned AMPs asking for specific partitions that they are assigned to process the query results.

Abstract: Techniques that facilitate management of skewed data during a parallel multiple join operation are provided. Portions of tables involved in the join operation can be distributed among a plurality of processing modules, and each of the processing modules can be provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules can scan the rows of first and second tables distributed to the processing modules and compare values of the join columns of both tables with the list of skewed values. One or more of the processing modules can then redistribute the skewed values.

Abstract: An umbilical hose end coupling that comprises a sleeve and an insert for the sleeve, the insert having a hose end for insertion into the hose and the sleeve having a hose end for covering the exterior of the hose and the insert, and the insert and sleeve each having a coupling end for engaging each other, and the sleeve having a first specified region that is subject to swaging and a second specified region that is not subject to swaging.