Parallel processing database tree structure
US-2015379078-A1 · Dec 31, 2015 · US
Relation path viability prediction
USRE45752E · US · E1
| Field | Value |
|---|---|
| Publication number | US-RE45752-E |
| Application number | US-2758504-A |
| Country | US |
| Kind code | E1 |
| Filing date | Dec 29, 2004 |
| Priority date | Jul 2, 1999 |
| Publication date | Oct 13, 2015 |
| Grant date | Oct 13, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
There is provided a process for predicting whether a query will produce a result in an information system formed of objects having different instances and relations between the objects. An instance-to-object bitmap is computed off-line, before queries are generated by a user: the bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When a query is generated, the bitmap is accessed to predict whether there exists a relation from the instance to the object, that is whether the query will issue a result. The process makes it possible for a user to abort queries without consuming run-time. It also makes it possible to guide users through navigation of a Webpage or the like, by suggesting relations that will produce results.
First claim
Opening claim text (preview).
What is claimed is: 1. In an information system comprising objects, instances of said objects and relationships between at least some of said objects and said instances of said objects, a method for predicting whether a query will produce a result, the method comprising the steps of: providing an instance-to-object bitmap which indicates whether instances of objects are related to other objects; and accessing the bitmap to determine if the query will produce a result.…
Assignees
Inventors
Classifications
- G06F17/30445Primary
Physics · mapped topic
- G06F16/2237Primary
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Cross-Sectional Technologies · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent USRE45752E cover?
- There is provided a process for predicting whether a query will produce a result in an information system formed of objects having different instances and relations between the objects. An instance-to-object bitmap is computed off-line, before queries are generated by a user: the bitmap is used to represent the existence of a relation path from instances to the other objects of a database. When…
- Who is the assignee on this patent?
- Gvily Yaniv, Agassi Shai, Sap Portals Israel Ltd
- What technology area does this patent fall under?
- Primary CPC classification G06F17/30445. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Oct 13 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (E1). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).