DesignsNet contains bibliographic basic data on designs entered into and deleted from the register and on pending, rejected, dismissed and withdrawn applications for design registration. The images of the designs are available to the extent that they are public.
If the search result only consists of one hit, it is displayed on a page called "Basic data of design". Otherwise, the search result is displayed as a list with data of not more than 4000 designs grouped in sets of 50.
How to search by application number
You can search for a specific design by the application number of an application for registration.
The asterisk (*) is used as a wildcard. You can use it either in the beginning or the end of an application number, or both.
You can replace a single character with a question mark (?).
The result will be arranged by application number.
How to search by registration number
You can search for a specific design by its registration number.
The asterisk (*) is used as a wildcard. You can use it either in the beginning or the end of a registration number, or both.
You can replace a single character with a question mark (?).
The result will be displayed in numerical order.
Combination search
You can also search for data by using the name of the design applicant or the owner of the design, the date of application, date of publication, or class of goods by using only one search criterion or by making your own combination.
How to search by applicant's or owner's name
The asterisk (*) is used as a wildcard. You can use it either in the beginning or the end of a name, or both.
You can replace a single character with a question mark (?).
In the name entry field, you can also use the number sign (#) as a wildcard at the end of the basic form of one word. In that case, the program will search for the name and all its inflected forms it recognises in the Finnish language.
If you write more than one word in the name entry field, the program will only retrieve combinations in which the words appear one after another.
The result will be displayed in alphabetical order.
How to search by date of application and date of publication
The date of application tells when the application has arrived in our Office. The date of publication tells when the design has been published in the Design Gazette.
When searching by only the date, the result will be displayed in descending order (the latest first).
You can search
applications arrived or published on a certain date (for example 2.1.2000)
applications arrived or published before a certain date (for example -1.1.2000)
applications arrived or published after a certain date (for example 1.1.2000-)
applications arrived or published between certain dates (for example 1.1.2000-1.3.2000).
How to search by class of goods
Data on designs belonging to a specific class of goods can be accessed by entering the class of goods.
When searching by class of goods, the search criterion must always consist of the entire class number (e.g., 1-01).
The asterisk (*) is used as a wildcard. You can use it either in the beginning or the end of a class of goods, or both.
You can replace a single character with a question mark (?).
The result will be displayed in alphabetical order.
Free text search searches all indexed texts (owner's and applicant's name, agent, creator of the design, designation) also by using special characters (for example, é, à).). Please note: When using a trademark as search criterion, the product name must be entered either in Finnish or Swedish depending on which language has been used in the application or registration.
The asterisk (*) is used as a wildcard. You can use it either in the beginning or the end of a search criterion, or both.
You can replace a single character with a question mark (?).
You can also use the number sign (#) as a wildcard at the end of the basic form of one word. In that case, the program will search for the name and all its inflected forms it recognises in the Finnish language.
If you write more than one word in the entry field, the program will only retrieve combinations in which the words appear one after another.
The result will be displayed in alphabetical order.