Partition management for a scalable, structured storage system is provided. The storage system provides storage represented by one or more tables, each of which includes rows that represent data entities. A table is partitioned into a number of partitions, each partition including a contiguous range of rows. The partitions are served by table servers and managed by a table master. Load distribution information for the table servers and partitions is tracked, and the table master determines to split and/or merge partitions based on the load distribution information.

Partition management in a partitioned, scalable, and available structured storage

An exemplary embodiment of a system, method and/or computer program product for creating a fare analytic database, may include: receiving, by at least one processor, fare(s) and fare related data; and creating a graph database of the fare(s) and fare related data; where the creating may include: creating one or more node(s) of the graph database representing at least one component of the fare and fare related data; creating one or more relationship(s) between a plurality of the nodes; and applying at least one property to the node(s) and the relationship(s). A fare analytic engine may further incorporate the database, and the engine may process queries traversing the database for fare and fare related data; and functional programming methods may be used to generate Boolean byte code routines from fare restrictions, according to exemplary embodiments disclosed.

System, method and computer program product for providing a fare analytic engine

Graph-based search queries using web content metadata

Belonging to the field of communication, the invention discloses a map navigation route acquiring method and a terminal. The method comprises: acquiring a navigation request involving a plurality of destinations, acquiring the coordinates of the plurality of destinations and the coordinate of a starting point; according to the coordinate of the starting point and the coordinates of the plurality of destinations, traversing multiple routes passing through all the destinations, with the number of paths included by each route being identical to the number of the plurality of destinations; calculating the lengths of the multiple routes respectively, and selecting a shortest route from the multiple routes. By traversing the multiple routes passing through all the destinations and selecting a shortest route from the multiple routes, a user can reach each destination according to the shortest route, thus avoiding the circumstances of repeating routes, neglecting a short route and making a detour. According to the invention, the user can more rapidly reach the continuous destinations, and the time and resources of the user are saved.

Map navigation route acquiring method and terminal

The invention relates to a route and time planning method of long-distance travel. The route and time planning method comprises a data processing center, a database and a plurality of access sides, wherein the access sides are connected with a processing center through a network, and the data processing center is connected with the database. The method comprises the following steps: inputting a place of departure and a first destination through any access side; obtaining the information of the access side by the data processing center, and calling all pieces of corresponding flight information in a time sequence from the database, wherein the flight information is round-trip flight information; automatically sorting all pieces of flight information according to price; and feeding back the flight information with the lowest price to the corresponding access side. The most economical travel time and routes can be provided for users, multi-point playing routes can be automatically recommended, more abundant route selection can be provided for users, and the search time of the users for multi-point playing is saved.

Route and time planning method of long-distance travel

A method of building actual travel fares in a computer, from fare databases, is disclosed. A graph of nodes representing travel destinations is built which comprises edges connecting pairs of nodes. Each edge references a lowest travel fare. Also, a tree of fares is built for each graph edge. Trees comprise at least a root node holding the lowest travel fare of the corresponding graph edge. They possibly include more nodes comprising a context key and an associated travel fare. Trees are organized to have children nodes holding a travel fare equal to or larger than travel fare of a parent node. Thus, less expensive fare paths can efficiently be extracted since graph edges, included in the fare paths, reference the associated trees of fares and are gone through in ascending order of their lowest fare values. A learning entity is used to build and update the trees of fares. It gathers its data from processes aimed at building travel solutions for the end-users. A system implementing the method of extracting fare paths according to the invention is made capable of handling many destinations in the elapsed time of a computer transaction thus, can propose thematic travel options to end-users who are not required to choose a particular destination to start planning a trip.

Method and system of building actual travel fares

A method for determining an optimal fare for a trip comprising a departure location, an arrival location, the method comprises the following steps: sending a request for the trip wherein the request comprises a departure location, an arrival location and a corresponding fare for the trip; automatically modifying the request by searching in a predetermined database to determine a set of additional requests wherein each comprises at least one of the departure location, the arrival location or one or more additional locations which may form at least a part of the requested route wherein the predetermined database comprises said additional requests and a corresponding fare for each additional request; selecting one or more additional requests to form one or more alternative requests which include at least on of the departure location or the arrival location as the request; calculating the up to date fares for each alternative request in order to determine a resulting fare for each alternative request; comparing the fare and the resulting fares in order to determine the lowest resulting fare for the trip.

Method and system for determining an optimal low fare for a trip

A global distribution system (GDS) organized for searching travel deals from a plurality of travel vendor fare databases (250) accessible by the GDS (200), includes: a travel multi-vendor search engine (TMVSE) operating on any database of the plurality of travel vendor fare databases; and a travel deal tracker (TDT) associated to the TMVSE (240), the TDT (270) providing directions to the TMVSE to limit the number of required transactions needed to obtain the searched travel deals.

Global distribution system for searching best travel deals

A global distribution system (GDS) organized for searching travel deals from a plurality of travel vendor fare databases is described. The GDS includes a travel multi-vendor search engine (TMVSE) operating on any one of the plurality of travel vendor fare databases it has access to. A travel deal tracker (TDT) is associated to the TMVSE. The TDT provides directions to the TMVSE to limit the number of required transactions needed to obtain the searched travel deals. The TDT is interrogated by the TMVSE each time a request from a travel comparison website is received. For each received request, directions are obtained under the form of a short list of travel vendor fare databases from where searching must be conducted. A GDS organized according to the invention allows to drastically reduce the overall level of transactions required to answer end-user requests.

Improved global distribution system for searching best travel deals

An enhanced travel search tool aimed at providing travel opportunities is described. The travel search tool includes a ticket splitter operating from a list of flight connections provided by a front-end flight search engine. The ticket splitter comprises a means for valuating all ticket partitions generated from the provided list of connection flights and a tree of split criteria updated in a cache for determining the partitions and attributing to each partition a probability value of obtaining a split-ticket solution. The ticket splitter also includes a means for selecting those of the valuated partitions that have a probability value higher than a defined threshold and provides a sorted list of recommended partitions to a back-end fare search engine to price all the selected partitions including a reference single-ticket solution. Travel search tool offering of travel opportunities is enhanced by automatically including multi-ticket travel solutions.

Automated split ticketing

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Marc Patoureaux

Author Tools

Chat about Author